CREx: inferring genomic rearrangements based on common intervals
暂无分享,去创建一个
Matthias Bernt | Daniel Merkle | Martin Middendorf | Peter F. Stadler | Martin Schlegel | Guido Fritzsch | Marleen Perseke | Detlef Bernhard | Kai Ramsch | P. Stadler | M. Middendorf | D. Merkle | G. Fritzsch | Marleen Perseke | M. Schlegel | D. Bernhard | Kai Ramsch | Matthias Bernt | Daniel Merkle
[1] Jens Stoye,et al. On the Similarity of Sets of Permutations and Its Applications to Genome Comparison , 2003, COCOON.
[2] Matthias Bernt,et al. A Fast and Exact Algorithm for the Perfect Reversal Median Problem , 2007, ISBRA.
[3] Christophe Paul,et al. Perfect Sorting by Reversals Is Not Always Difficult , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[4] Satish Rao,et al. On the tandem duplication-random loss model of genome rearrangement , 2006, SODA '06.
[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[6] J. Boore. Animal mitochondrial genomes. , 1999, Nucleic acids research.
[7] Jijun Tang,et al. Reconstructing phylogenies from gene-content and gene-order data , 2007, Mathematics of Evolution and Phylogeny.
[8] J. Inoue,et al. Evolution of the deep-sea gulper eel mitochondrial genomes: large-scale gene rearrangements originated within the eels. , 2003, Molecular biology and evolution.
[9] Laxmi Parida,et al. Using PQ Structures for Genomic Rearrangement Phylogeny , 2006, J. Comput. Biol..
[10] A. Arndt,et al. Mitochondrial gene rearrangement in the sea cucumber genus Cucumaria. , 1998, Molecular biology and evolution.
[11] C. Paul,et al. Perfect Sorting by Reversals Is Not Always Difficult , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[12] P. Stadler,et al. Evolution of mitochondrial gene orders in echinoderms. , 2008, Molecular phylogenetics and evolution.
[13] Matthias Bernt,et al. Using median sets for inferring phylogenetic trees , 2007, Bioinform..