On the Similarity of Sets of Permutations and its Applications to Genome Comparison
Bergeron A, Stoye J (2003) Forschungsberichte.
Bielefeld: Technische Fakultät der Universität Bielefeld.
Report | Englisch
Download
Autor*in
Bergeron, Anne;
Stoye, JensUniBi 
Einrichtung
Abstract / Bemerkung
The comparison of genomes with the same gene content relies on our ability to compare permutations, either by measuring how much they differ, or by measuring how much they are alike. With the notable exception of the breakpoint distance, which is based on the concept of conserved adjacencies, measures of distance do not generalize easily to sets of more than two permutations. In this paper, we present a basic unifying notion, conserved intervals, as a powerful generalization of adjacencies, and as a key feature of genome rearrangement theories. We also show that sets of conserved intervals have elegant nesting and chaining properties that allow the development of compact graphic representations, and linear time algorithms to manipulate them.
Stichworte
Genome rearrangement;
Conserved intervals;
Comparative genomics;
Gene cluster;
Bioinformatics;
Permutations
Erscheinungsjahr
2003
Serientitel
Forschungsberichte
Page URI
https://pub.uni-bielefeld.de/record/1970477
Zitieren
Bergeron A, Stoye J. On the Similarity of Sets of Permutations and its Applications to Genome Comparison. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld; 2003.
Bergeron, A., & Stoye, J. (2003). On the Similarity of Sets of Permutations and its Applications to Genome Comparison (Forschungsberichte). Bielefeld: Technische Fakultät der Universität Bielefeld.
Bergeron, Anne, and Stoye, Jens. 2003. On the Similarity of Sets of Permutations and its Applications to Genome Comparison. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld.
Bergeron, A., and Stoye, J. (2003). On the Similarity of Sets of Permutations and its Applications to Genome Comparison. Forschungsberichte, Bielefeld: Technische Fakultät der Universität Bielefeld.
Bergeron, A., & Stoye, J., 2003. On the Similarity of Sets of Permutations and its Applications to Genome Comparison, Forschungsberichte, Bielefeld: Technische Fakultät der Universität Bielefeld.
A. Bergeron and J. Stoye, On the Similarity of Sets of Permutations and its Applications to Genome Comparison, Forschungsberichte, Bielefeld: Technische Fakultät der Universität Bielefeld, 2003.
Bergeron, A., Stoye, J.: On the Similarity of Sets of Permutations and its Applications to Genome Comparison. Forschungsberichte. Technische Fakultät der Universität Bielefeld, Bielefeld (2003).
Bergeron, Anne, and Stoye, Jens. On the Similarity of Sets of Permutations and its Applications to Genome Comparison. Bielefeld: Technische Fakultät der Universität Bielefeld, 2003. Forschungsberichte.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
Dieses Objekt ist durch das Urheberrecht und/oder verwandte Schutzrechte geschützt. [...]
Volltext(e)
Name
Access Level
Open Access
Zuletzt Hochgeladen
2019-09-06T08:57:14Z
MD5 Prüfsumme
facd6a33a341e3e9a3b54ef645baea15
Google Scholar