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

Bergeron A, Stoye J (2006)
JOURNAL OF COMPUTATIONAL BIOLOGY 13(7): 1340-1354.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
;
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
Zeitschriftentitel
JOURNAL OF COMPUTATIONAL BIOLOGY
Band
13
Ausgabe
7
Seite(n)
1340-1354
ISSN
eISSN
PUB-ID

Zitieren

Bergeron A, Stoye J. On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY. 2006;13(7):1340-1354.
Bergeron, A., & Stoye, J. (2006). On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY, 13(7), 1340-1354. doi:10.1089/cmb.2006.13.1340
Bergeron, A., and Stoye, J. (2006). On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY 13, 1340-1354.
Bergeron, A., & Stoye, J., 2006. On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY, 13(7), p 1340-1354.
A. Bergeron and J. Stoye, “On the similarity of sets of permutations and its applications to genome comparison”, JOURNAL OF COMPUTATIONAL BIOLOGY, vol. 13, 2006, pp. 1340-1354.
Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY. 13, 1340-1354 (2006).
Bergeron, Anne, and Stoye, Jens. “On the similarity of sets of permutations and its applications to genome comparison”. JOURNAL OF COMPUTATIONAL BIOLOGY 13.7 (2006): 1340-1354.

12 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order.
Zhou X, Amir A, Guerra C, Landau G, Rossignac J., J Comput Biol 25(11), 2018
PMID: 30113868
Constructing a Gene Team Tree in Almost O (n lg n) Time.
Wang BF, Lin CH, Yang IT., IEEE/ACM Trans Comput Biol Bioinform 11(1), 2014
PMID: 26355514
Easy identification of generalized common and conserved nested intervals.
de Montgolfier F, Raffinot M, Rusu I., J Comput Biol 21(7), 2014
PMID: 24650221
Gene order alignment on trees with multiOrthoAlign.
Benzaid B, El-Mabrouk N., BMC Genomics 15 Suppl 6(), 2014
PMID: 25572278
Ancestral genome organization: an alignment approach.
Holloway P, Swenson K, Ardell D, El-Mabrouk N., J Comput Biol 20(4), 2013
PMID: 23560866
A new efficient algorithm for the gene-team problem on general sequences.
Wang BF, Kuo CC, Liu SJ, Lin CH., IEEE/ACM Trans Comput Biol Bioinform 9(2), 2012
PMID: 22282907
Cactus graphs for genome comparisons.
Paten B, Diekhans M, Earl D, John JS, Ma J, Suh B, Haussler D., J Comput Biol 18(3), 2011
PMID: 21385048
Consistency of sequence-based gene clusters.
Wittler R, Maňuch J, Patterson M, Stoye J., J Comput Biol 18(9), 2011
PMID: 21899413
Finding nested common intervals efficiently.
Blin G, Faye D, Stoye J., J Comput Biol 17(9), 2010
PMID: 20874403
A unified approach for reconstructing ancient gene clusters.
Stoye J, Wittler R., IEEE/ACM Trans Comput Biol Bioinform 6(3), 2009
PMID: 19644167
Solving the preserving reversal median problem.
Bernt M, Merkle D, Middendorf M., IEEE/ACM Trans Comput Biol Bioinform 5(3), 2008
PMID: 18670038

20 References

Daten bereitgestellt von Europe PubMed Central.


AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

Bergeron, LNBI 3240(), 2004
Common intervals and sorting by reversals: a marriage of necessity.
Bergeron A, Heber S, Stoye J., Bioinformatics 18 Suppl 2(), 2002
PMID: 12385983

AUTHOR UNKNOWN, 0
Gene order breakpoint evidence in animal mitochondrial phylogeny.
Blanchette M, Kunisawa T, Sankoff D., J. Mol. Evol. 49(2), 1999
PMID: 10441671

AUTHOR UNKNOWN, 0
Genome-scale evolution: reconstructing gene orders in the ancestral species.
Bourque G, Pevzner PA., Genome Res. 12(1), 2002
PMID: 11779828

AUTHOR UNKNOWN, 0

Hannenhalli, Proc. FOCS (), 1995

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Two notes on genome rearrangement.
Ozery-Flato M, Shamir R., J Bioinform Comput Biol 1(1), 2003
PMID: 15290782
Short inversions and conserved gene cluster.
Sankoff D., Bioinformatics 18(10), 2002
PMID: 12376374

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Quellen

PMID: 17037962
PubMed | Europe PMC

Suchen in

Google Scholar