SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems

Feijão P, Meidanis J (2011)
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(5): 1318-1329.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
DOI
Autor*in
Feijão, PedroUniBi; Meidanis, J.
Einrichtung
Technische Fakultät > AG Genominformatik
Erscheinungsjahr
2011
Zeitschriftentitel
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Band
8
Ausgabe
5
Seite(n)
1318-1329
ISSN
1545-5963
Page URI
https://pub.uni-bielefeld.de/record/2659339

Zitieren

Feijão P, Meidanis J. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2011;8(5):1318-1329.
Feijão, P., & Meidanis, J. (2011). SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5), 1318-1329. doi:10.1109/TCBB.2011.34
Feijão, Pedro, and Meidanis, J. 2011. “SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (5): 1318-1329.
Feijão, P., and Meidanis, J. (2011). SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, 1318-1329.
Feijão, P., & Meidanis, J., 2011. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5), p 1318-1329.
P. Feijão and J. Meidanis, “SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, 2011, pp. 1318-1329.
Feijão, P., Meidanis, J.: SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8, 1318-1329 (2011).
Feijão, Pedro, and Meidanis, J. “SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems”. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8.5 (2011): 1318-1329.

14 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
Hartmann T, Chu AC, Middendorf M, Bernt M., IEEE/ACM Trans Comput Biol Bioinform 15(1), 2018
PMID: 28114075
A complete logical approach to resolve the evolution and dynamics of mitochondrial genome in bilaterians.
Oxusoff L, Préa P, Perez Y., PLoS One 13(3), 2018
PMID: 29547666
On the rank-distance median of 3 permutations.
Chindelevitch L, Pereira Zanetti JP, Meidanis J., BMC Bioinformatics 19(suppl 6), 2018
PMID: 29745865
Sorting by Cuts, Joins, and Whole Chromosome Duplications.
Zeira R, Shamir R., J Comput Biol 24(2), 2017
PMID: 27704866
Reconstructing cancer karyotypes from short read data: the half empty and half full glass.
Eitan R, Shamir R., BMC Bioinformatics 18(1), 2017
PMID: 29141589
Median Approximations for Genomes Modeled as Matrices.
Zanetti JPP, Biller P, Meidanis J., Bull Math Biol 78(4), 2016
PMID: 27072561
eSTGt: a programming and simulation environment for population dynamics.
Spiro A, Shapiro E., BMC Bioinformatics 17(1), 2016
PMID: 27117841
Representing and decomposing genomic structural variants as balanced integer flows on sequence graphs.
Zerbino DR, Ballinger T, Paten B, Hickey G, Haussler D., BMC Bioinformatics 17(1), 2016
PMID: 27687569
Fast ancestral gene order reconstruction of genomes with unequal gene content.
Feijão P, Araujo E., BMC Bioinformatics 17(suppl 14), 2016
PMID: 28185578
Sampling and counting genome rearrangement scenarios.
Miklós I, Smith H., BMC Bioinformatics 16 Suppl 14(), 2015
PMID: 26452124
Reconstruction of ancestral gene orders using intermediate genomes.
Feijão P., BMC Bioinformatics 16 Suppl 14(), 2015
PMID: 26451811
Rearrangement-based phylogeny using the Single-Cut-or-Join operation.
Biller P, Feijão P, Meidanis J., IEEE/ACM Trans Comput Biol Bioinform 10(1), 2013
PMID: 23702549
Extending the algebraic formalism for genome rearrangements to include linear chromosomes.
Feijão P, Meidanis J., IEEE/ACM Trans Comput Biol Bioinform 10(4), 2013
PMID: 24334378
Linearization of ancestral multichromosomal genomes.
Maňuch J, Patterson M, Wittler R, Chauve C, Tannier E., BMC Bioinformatics 13 Suppl 19(), 2012
PMID: 23281593

50 References

Daten bereitgestellt von Europe PubMed Central.

Genome halving with double cut and join.
Warren R, Sankoff D., J Bioinform Comput Biol 7(2), 2009
PMID: 19340920
Multiple genome rearrangement and breakpoint phylogeny.
Sankoff D, Blanchette M., J. Comput. Biol. 5(3), 1998
PMID: 9773350
New approaches for reconstructing phylogenies from gene order data.
Moret BM, Wang LS, Warnow T, Wyman SK., Bioinformatics 17 Suppl 1(), 2001
PMID: 11473006
Multichromosomal median and halving problems under different genomic distances.
Tannier E, Zheng C, Sankoff D., BMC Bioinformatics 10(), 2009
PMID: 19386099
Breakpoint Phylogenies
blanchette, Proc Genome Informatics Ser Workshop Genome Informatics 8(), 1997
A 1.375-approximation algorithm for sorting by transpositions.
Elias I, Hartman T., IEEE/ACM Trans Comput Biol Bioinform 3(4), 2006
PMID: 17085846

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Genome sequence comparison and scenarios for gene rearrangements: a test case.
Hannenhalli S, Chappey C, Koonin EV, Pevzner PA., Genomics 30(2), 1995
PMID: 8586431

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Lengths of chromosomal segments conserved since divergence of man and mouse.
Nadeau JH, Taylor BA., Proc. Natl. Acad. Sci. U.S.A. 81(3), 1984
PMID: 6583681
Analysis of Circular Genome Rearrangement by Fusions, Fissions and Block-Interchanges
lu, BMC Bioinformatics (), 2006

AUTHOR UNKNOWN, 0
Efficient sorting of genomic permutations by translocation, inversion and block interchange.
Yancopoulos S, Attie O, Friedberg R., Bioinformatics 21(16), 2005
PMID: 15951307

AUTHOR UNKNOWN, 0
Inversions in the Third Chromosome of Wild Races of Drosophila Pseudoobscura, and Their Use in the Study of the History of the Species.
Sturtevant AH, Dobzhansky T., Proc. Natl. Acad. Sci. U.S.A. 22(7), 1936
PMID: 16577723
The origin and behavior of mutable loci in maize.
McCLINTOCK B., Proc. Natl. Acad. Sci. U.S.A. 36(6), 1950
PMID: 15430309
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
Bader M, Abouelhoda MI, Ohlebusch E., BMC Bioinformatics 9(), 2008
PMID: 19055792
Reconstructing contiguous regions of an ancestral genome.
Ma J, Zhang L, Suh BB, Raney BJ, Burhans RC, Kent WJ, Blanchette M, Haussler D, Miller W., Genome Res. 16(12), 2006
PMID: 16983148

AUTHOR UNKNOWN, 0
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.
Bader DA, Moret BM, Yan M., J. Comput. Biol. 8(5), 2001
PMID: 11694179
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
moret, WABI Proc Second Int'l Workshop Algorithms in Bioinformatics (), 2002
Disk-covering, a fast-converging method for phylogenetic tree reconstruction.
Huson DH, Nettles SM, Warnow TJ., J. Comput. Biol. 6(3-4), 1999
PMID: 10582573
Scaling up accurate phylogenetic reconstruction from gene-order data.
Tang J, Moret BM., Bioinformatics 19 Suppl 1(), 2003
PMID: 12855474
Genome-scale evolution: reconstructing gene orders in the ancestral species.
Bourque G, Pevzner PA., Genome Res. 12(1), 2002
PMID: 11779828
Using median sets for inferring phylogenetic trees.
Bernt M, Merkle D, Middendorf M., Bioinformatics 23(2), 2007
PMID: 17237080
The ABCs of MGR with DCJ.
Adam Z, Sankoff D., Evol. Bioinform. Online 4(), 2008
PMID: 19204809
A Unifying View of Genome Rearrangements
bergeron, WABI '06 Proc Sixth Int'l Workshop Algorithms in Bioinformatics (), 2006

AUTHOR UNKNOWN, 0

pevzner, RECOMB (), 2003

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Breakpoint graphs and ancestral genome reconstructions.
Alekseyev MA, Pevzner PA., Genome Res. 19(5), 2009
PMID: 19218533
Recovering genome rearrangements in the mammalian phylogeny.
Zhao H, Bourque G., Genome Res. 19(5), 2009
PMID: 19411607

AUTHOR UNKNOWN, 0
The Median Problems for Breakpoints Are NP-Complete
pe'er, Electronic Colloquium on Computational Complexity 71(), 1998
Genome Aliquoting with Double Cut and Join
warren, BMC Bioinformatics (), 2009
The Complexity of the Breakpoint Median Problem
bryant, 1998
Genome Halving under DCJ Revisited
mixtacki, COCOON '08 Proc 14th Ann Int'l Conf Computing and Combinatorics (), 2008
Colored de Bruijn graphs and the genome halving problem.
Alekseyev MA, Pevzner PA., IEEE/ACM Trans Comput Biol Bioinform 4(1), 2007
PMID: 17277417

AUTHOR UNKNOWN, 0
Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes.
Zheng C, Zhu Q, Adam Z, Sankoff D., Bioinformatics 24(13), 2008
PMID: 18586750

lov�sz, Annals of Discrete Mathematics 29(), 1986

AUTHOR UNKNOWN, 0
Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae.
Kellis M, Birren BW, Lander ES., Nature 428(6983), 2004
PMID: 15004568

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: 21339538
PubMed | Europe PMC

Suchen in

Google Scholar