• Title/Summary/Keyword: entire sequence

Search Result 254, Processing Time 0.026 seconds

Determination of Phylogenetic Relationships of Turkish Native Cattle Breeds with Other Cattle Breeds Using Mitochondrial DNA D-loop Sequence Polymorphism

  • Ozdemir, Memis;Dogru, Unsal
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.22 no.7
    • /
    • pp.955-961
    • /
    • 2009
  • The aim of this study was to determine the specific polymorphic sites in cattle breeds and inter- and interbreed genetic variation among breeds and to develop a databank of Turkish native cattle mtDNA using sequence analysis. The entire D-loop region was analyzed based on DNA sequences in Turkish Grey, East Anatolian Red, South Anatolian Red, and Anatolian Black native breeds. In total, 68 nucleotide differences were observed at 26 different sites. The variable positions consisted of 22 transitions, two transversions, and two insertions, but no deletions. Haplotype number, haplotype diversity, nucleotide diversity, and mean number of pairwise difference values were found to be 17, 0.993, 0.00478, and 4.275, respectively. In addition, a phylogeny was developed by comparison among cattle populations for which the entire D-loop sequence was available. A high level of genetic variation was observed within and among the native cattle breeds.

ON THE HEREDITARILY HYPERCYCLIC OPERATORS

  • Yousefi, Bahman;Farrokhinia, Ali
    • Journal of the Korean Mathematical Society
    • /
    • v.43 no.6
    • /
    • pp.1219-1229
    • /
    • 2006
  • Let X be a separable Banach space. We give sufficient conditions under which $T:X{\rightarrow}X$ is hereditarily hypercyclic. Also, we prove that hereditarily hypercyclicity with respect to a special sequence implies the hereditarily hypercyclicity with respect to the entire sequence.

A Study on Spatial Scheduling in the P.E. Stage (선행 탑재장에서의 공간일정계획에 관안 연구)

  • Koo Chung-kon;Yoon Duck-Young;Bae Tae-Kyu;Cho Min-Ch
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.61-66
    • /
    • 2004
  • In this paper an effort is made to develop an innovative spatial arrangement concept pertaining to ship building industry. The spatial scheduling is the problem that concentrates on effective planning of available space and arrangements of blocks and in a priority manner. In order to create an effective spatial scheduling. a database providing the priority has to be available to make the erection sequence. Such a system works hand in hand with erection sequence generator program The erection sequence program works on the conventional network analysis method which uses a typical parent-children idea for the calculation of the ENT(possible earliest network start time) and LNT(possible latest network start time). This program works in a cyclic manner taking turns by calculating the ENT in upward trace and LNT on the return trace thereby generating the entire erection sequence diagram for the requisite problem The generated database serves as an input data for spatial scheduling problem. When the system works it takes into consideration the entire system based on heuristic concepts as mentioned. There system uses the spatial aspects such as the available area of the P. E area and plan area of the corresponding blocks and its priority of erection from the erection sequence generator program develops the spatial scheduling arrangement. In this paper using all these concepts an innovative spatial schedule development system developed.

  • PDF

Filtering of spatially invariant image sequences with one desired process

  • Oh, Youngin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.520-525
    • /
    • 1992
  • This paper reports several mathematical properties of the filter vector developed for processing linearly-additive spatially-invariant image sequences. In this filtering of an image sequence into a single filtered image, the information about the image components originally distributed over the entire sequence is compressed into the one new image in a way that the desired component is enhanced and the undesired (interfering) components and noise are suppressed.

  • PDF

ON A GENERALIZED DIFFERENCE SEQUENCE SPACES OVER NON-ARCHIMEDIAN FIELDS AND RELATED MATRIX TRANSFORMATIONS

  • BATAINEH AHMAD H. A.;AL-ZA'AREER HAMZA B.
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.723-729
    • /
    • 2005
  • Let F be a non-trivial non-Archimedian field. The sequence spaces $\Gamma\;(F)\;and\;{\Gamma}^{\ast}(F)$ were defined and studied by Soma-sundaram[4], where these spaces denote the spaces of entire and analytic sequences defined over F, respectively. In 1997, these spaces were generalized by Mursaleen and Qamaruddin[1] by considering an arbitrary sequence $U\;=\;(U_k),\;U_k\;{\neq}\;0 \;(\;k\;=\;1,2,3,{\cdots})$. They characterized some classes of infinite matrices considering these new classes of sequences. In this paper, we further generalize the above mentioned spaces and define the spaces $\Gamma(u,\;F,\;{\Delta}),\;{\Gamma}^{\ast}(u,\;F,\;{\Delta}),\;l_p(u,\;F,\;{\Delta})$), and $b_v(u,\;F,\;{\Delta}$). We also study some matrix transformations on these new spaces.

Determination and application of installation sequence of piping systems in cramped spaces of ships and offshore structures considering geometric relationship of pipe elements

  • Jang, MiSeon;Nam, Jong-Ho
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.60-70
    • /
    • 2020
  • The outfitting design of ships and offshore structures is mainly undertaken in a restricted space. Pipes occupying a large portion of outfitting design are normally manufactured outside the shipyard. This complicated manufacturing process results in frequent delivery delays. Inevitable design modifications and material changes have also resulted in inefficient pipe installation works. In this study, an algorithm is proposed to systematically determine the pipe installation sequence. An accurate and fast algorithm to identify the geometric relationship of piping materials is presented. To improve the calculation efficiency, the interference is gradually examined from simplified to complicated shapes. It is demonstrated that the calculation efficiency is significantly improved with successive geometric operations such as back-face culling and use of bounding boxes. After the final installation sequence is determined, the entire installation process is visualized in a virtual reality environment so that the process can be rendered and understood for a full-scale model.

Design and Implementation of an LED Mood Lighting System Using Personalized Color Sequence Generation

  • Jeong, Gu-Min;Yeo, Jong-Yun;Won, Dong Mook;Bae, Sung-Han;Park, Kyung-Joon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3182-3196
    • /
    • 2012
  • In this paper, we present a new LED (Light Emitting Diode) mood lighting system interacting with smartphones based on the generation of different light sequences. In the proposed system, one light sequence is considered to be one unit of the service contents, which is then transmitted through a network and played in an LED lighting system. To this end, we propose a novel generation scheme using a smartphone, and a decoding/playing mechanism in an LED lighting system. The lighting sequences have a fixed period divided into predefined time units. Two modes - basic and interpolation - are supported in each time unit when playing a color sequence. In the basic mode, the color is maintained for the entire time unit, whereas in the interpolation mode the color is interpolated. The sequence is decoded and played in the lighting circuit by changing the duty cycle of a PWM (Pulse Width Modulation) signal. A demonstration system of the overall proposed method was using smartphones, a server and an LED lighting system. The results from this experiment show the validity and applicability of the proposed scheme.

Genetic diversity of Kalopanax pictus populations in Korea based on the nrDNA ITS sequence

  • Sun, Yan-Lin;Lee, Hak-Bong;Kim, Nam-Young;Park, Wan-Geun;Hong, Soon-Kwan
    • Journal of Plant Biotechnology
    • /
    • v.39 no.1
    • /
    • pp.75-80
    • /
    • 2012
  • $Kalopanax$ $pictus$ is a long-lived deciduous perennial tree in the family Araliaceae mainly distributed in the East Asia. In Korea, this species is of ecological and medical importance. Because typical populations of this species are small and distributed in patches, $K.$ $pictus$ has been considered as a narrow habitat species. To understand the genetic diversity and population structure of this species, the sequence variation of the nuclear ribosomal DNA (nrDNA) internal transcribed spacer (ITS) region was analyzed among 18 different $K.$ $pictus$ populations in the present investigation. The nrDNA ITS sequences of Korean populations investigated in this study showed identical of 616 bp in length, and no any nucleotide variation was found in the entire nrDNA ITS region sequence. This result suggested that the $K.$ $pictus$ populations in Korea might belong to the same isolate, and no mutation was found in the nrDNA ITS region. Compared with other known ITS sequence sources from $K.$ $pictus$ populations, only four variable nucleotide sites were found within the entire ITS region. Very narrow genetic diversity appearing in the population level of $K.$ $pictus$ makes us hypothesize that their relatively isolated habitats. The long-lived traits might be one main reason. However, another probability was that the nr-DNA ITS region might be noneffective in classifying populations of $K.$ $pictus$. Thus, to further understand the phylogenetic relationship of $K.$ $pictus$ populations, more samplings should be performed based on more DNA sequences.

One Step Cloning of Defined DNA Fragments from Large Genomic Clones

  • Scholz, Christian;Doderlein, Gabriele;Simon, Horst H.
    • BMB Reports
    • /
    • v.39 no.4
    • /
    • pp.464-467
    • /
    • 2006
  • Recently, the nucleotide sequences of entire genomes became available. This information combined with older sequencing data discloses the exact chromosomal location of millions of nucleotide markers stored in the databases at NCBI, EMBO or DDBJ. Despite having resolved the intron/exon structures of all described genes within these genomes with a stroke of a pen, the sequencing data opens up other interesting possibilities. For example, the genomic mapping of the end sequences of the human, murine and rat BAC libraries generated at The Institute for Genomic Research (TIGR), reveals now the entire encompassed sequence of the inserts for more than a million of these clones. Since these clones are individually stored, they are now an invaluable source for experiments which depend on genomic DNA. Isolation of smaller fragments from such clones with standard methods is a time consuming process. We describe here a reliable one-step cloning technique to obtain a DNA fragment with a defined size and sequence from larger genomic clones in less than 48 hours using a standard vector with a multiple cloning site, and common restriction enzymes and equipment. The only prerequisites are the sequences of ends of the insert and of the underlying genome.