On the similarity of sets of permutations and its applications to genome comparison

Bergeron A, Stoye J (2003)
In: Proc. of COCOON 2003. LNCS, 2697. 68-79.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Bergeron, Anne; Stoye, JensUniBi
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.
Erscheinungsjahr
2003
Titel des Konferenzbandes
Proc. of COCOON 2003
Serien- oder Zeitschriftentitel
LNCS
Band
2697
Seite(n)
68-79
Konferenz
COCOON 2003
Konferenzort
Big Sky, MT, USA
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/1610433

Zitieren

Bergeron A, Stoye J. On the similarity of sets of permutations and its applications to genome comparison. In: Proc. of COCOON 2003. LNCS. Vol 2697. 2003: 68-79.
Bergeron, A., & Stoye, J. (2003). On the similarity of sets of permutations and its applications to genome comparison. Proc. of COCOON 2003, LNCS, 2697, 68-79. https://doi.org/10.1007/3-540-45071-8_9
Bergeron, Anne, and Stoye, Jens. 2003. “On the similarity of sets of permutations and its applications to genome comparison”. In Proc. of COCOON 2003, 2697:68-79. LNCS.
Bergeron, A., and Stoye, J. (2003). “On the similarity of sets of permutations and its applications to genome comparison” in Proc. of COCOON 2003 LNCS, vol. 2697, 68-79.
Bergeron, A., & Stoye, J., 2003. On the similarity of sets of permutations and its applications to genome comparison. In Proc. of COCOON 2003. LNCS. no.2697 pp. 68-79.
A. Bergeron and J. Stoye, “On the similarity of sets of permutations and its applications to genome comparison”, Proc. of COCOON 2003, LNCS, vol. 2697, 2003, pp.68-79.
Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. Proc. of COCOON 2003. LNCS. 2697, p. 68-79. (2003).
Bergeron, Anne, and Stoye, Jens. “On the similarity of sets of permutations and its applications to genome comparison”. Proc. of COCOON 2003. 2003.Vol. 2697. LNCS. 68-79.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Suchen in

Google Scholar