1000 resultados para Stationary Sequence
Resumo:
The complete mitochondrial DNA sequence was determined for the Australian freshwater crayfish Cherax destructor (Crustacea: Decapoda: Parastacidae). The 15,895-bp genome is circular with the same gene composition as that found in other metazoans. However, we report a novel gene arrangement with respect to the putative arthropod ancestral gene order and all other arthropod mitochondrial genomes sequenced to date. It is apparent that 11 genes have been translocated (ND1, ND4, ND4L, Cyt b, srRNA, and tRNAs Ser(UGA), Leu(CUN), Ile, Cys, Pro, and Val), two of which have also undergone inversions (tRNAs Pro and Val). The ‘duplication/random loss’ mechanism is a plausible model for the observed translocations, while ‘intramitochondrial recombination’ may account for the gene inversions. In addition, the arrangement of rRNA genes is incompatible with current mitochondrial transcription models, and suggests that a different transcription mechanism may operate in C. destructor.
Resumo:
The complete mitochondrial DNA of the blacklip abalone Haliotis rubra (Gastropoda: Mollusca) was cloned and 16,907 base pairs were sequenced. The sequence represents an estimated 99.85% of the mitochondrial genome, and contains 2 ribosomal RNA, 22 transfer RNA, and 13 protein-coding genes found in other metazoan mtDNA. An AT tandem repeat and a possible C-rich domain within the putative control region could not be fully sequenced. The H. rubra mtDNA gene order is novel for mollusks, separated from the black chiton Katharina tunicata by the individual translocations of 3 tRNAs. Compared with other mtDNA regions, sequences from the ATP8, NAD2, NAD4L, NAD6, and 12S rRNA genes, as well as the control region, are the most variable among representatives from Mollusca, Arthropoda, and Rhynchonelliformea, with similar mtDNA arrangements to H. rubra. These sequences are being evaluated as genetic markers within commercially important Haliotis species, and some applications and considerations for their use are discussed.
Resumo:
This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.
Resumo:
This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.
