Phylogenetic reconstruction from transpositions

BMC Genomics

Volumn 9, Issue SUPPL. 2, 2008, Pages

  Yue, Feng ^a   Zhang, Meng ^b   Tang, Jijun ^a  

^a The Department of Mechanical Engineering   (United States)

^b JILIN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM; CONFERENCE PAPER; DNA TRANSPOSITION; GENE REARRANGEMENT; GENE STRUCTURE; GENETIC DATABASE; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; PHYLOGENETIC TREE CONSTRUCTION METHOD; ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; COMPUTER SIMULATION; GENE ORDER; GENOME; METHODOLOGY; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; GENE ORDER; GENE REARRANGEMENT; GENOME; MODELS, GENETIC; PHYLOGENY;

EID: 52249123689     PISSN: None     EISSN: 14712164     Source Type: Journal    
DOI: 10.1186/1471-2164-9-S2-S15     Document Type: Conference Paper

References (26)

1. Downie S Palmer J Use of chloroplast DNA rearrangements in reconstructing plant phylogeny Plant Molecular Systematics Soltis P, Soltis D, Doyle J 1992:14-35.
2. Blanchette M Sankoff D The median problem for breakpoints in comparative genomics Proc 3rd Int'l Combinatorics and Computing Conf (COCOON'97), Lecture Notes in Computer Science 1997, 1276:251-263.
3. Hannenhalli S Pevzner P Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals) Proc 27th Ann Symp Theory of Computing (STOC'95) ACM 1995:178-189.
4. Caprara A On the practical solution of the reversal median problem Proc 1st Workshop Algs in Bioinformatics (WABI'01), Lecture Notes in Computer Science 2001, 2149:238-251.
5. Moret B Wyman S Bader D Warnow T Yan M A new implementation and detailed study of breakpoint analysis Proc 6th Pacific Symp Biocomputing (PSB'01), Hawaii 2001:583-594.
6. Bourque G Pevzner P Genome-scale evolution: Reconstructing gene orders in the ancestral species Genome Research 2002, 12:26-36. 155248 11779828
7. Boore J Brown W Big trees from little genomes: Mitochondrial gene order as a phylogenetic tool Current Opinion in Genetics and Development 1998, 8(6):668-674.
8. Cosner M Jansen R Palmer J Downie S The highly rearranged chloroplast genome of Trachelium caeruleum (Campanulaceae): Multiple inversions, inverted repeat expansion and contraction, transposition, insertions/ deletions, and several repeat families Current Genetics 1997, 31:419-429. 9162114
9. Bader D Moret B Yan M A linear-time algorithm for computing inversion distance between signed permutations with an experimental study Proc 7th Int'l Workshop on Algorithms and Data Structures (WADS'01), Lecture Notes in Computer Science 2001, 2125:365-376.
10. Elias I Hartman T A 1.375-approximation algorithm for sorting by transpositions Proc 5th Workshop Algs in Bioinformatics (WABI'05), Lecture Notes in Computer Science 2005, 3692:204-215.
11. Yancopoulos S Attie O Friedberg R Efficient sorting of genomic permutations by translocation, inversion and block interchange Bioinformatics 2005, 21:3340-3346. 15951307
12. Bergeron A Mixtacki J Stoye J A unifying view of genome rearrangements Proc 6th Workshop Algs in Bioinformatics (WABI'06), Lecture Notes in Computer Science 2006, 4175:163-173.
13. Pe'er I Shamir R The median problems for breakpoints are NP-complete Elec Colloq on Comput Complexity 1998, 71.
14. Siepel A Moret B Finding an optimal inversion median: Experimental results Proc 1st Workshop Algs in Bioinformatics (WABI'01), Lecture Notes in Computer Science 2001, 2149:189-203.
15. Moret B Siepel A Tang J Liu T Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data Proc 2nd Workshop Algs in Bioinformatics (WABI'02), Lecture Notes in Computer Science 2002, 2452:521-536.
16. Bernt M Merkle D Middendorf M Genome rearrangement based on reversals that preserve conserved intervals IEEE-ACM Trans Computational Biology and Bioinformatics 2006, 3(3):275-288.
17. Zhang M Tang J Median computation for the double-cut-and-join (DCJ) distance 2008.
18. Saitou N Nei M The neighbor-joining method: A new method for reconstructing phylogenetic trees Mol Biol Evol 1987, 4:406-425. 3447015
19. Wang L Exact-IEBP: A new technique for estimating evolutionary distances between whole genomes Proc 1st Workshop Algs in Bioinformatics (WABI'01), Lecture Notes in Computer Science 2001, 2149:176-190.
20. Wang L Jansen R Moret B Raubeson L Warnow T Fast phylogenetic methods for genome rearrangement evolution: An empirical study Proc 7th Pacific Symp Biocomputing (PSB'02), Hawaii 2002:524-535.
21. Swofford D Olsen G Waddell P Hillis D Phylogenetic inference Molecular Systematics Sunderland, MA: Sinauer Hillis D, Moritz C, Mable B 1996:407-514.
22. Tang J Moret B Scaling up accurate phylogenetic reconstruction from gene-order data Proc 11th Int'l Conf on Intel Sys for Mol Bio (ISMB'03), of Bioinformatics 2003, 19(suppl 1):i305-i312.
23. Blanchette M derange2 ftp://ftp.ebi.ac.uk/pub/software/unix/ derange2.tar.Z
24. Tang J Moret B Cui L dePamphilis C Phylogenetic reconstruction from arbitrary gene-order dat Proc 4th IEEE Symp on Bioinformatics and Bioengineering (BIBE'04) IEEE Press 2004:592-599.
25. Hannenhalli S Pevzner P To cut... or not to cut (applications of comparative physical maps in molecular evolution) Proc 7th Ann Symp Discrete Algorithms (SODA'96) 1996:304-313.
26. Moret B Tang J Wang L Warnow T Steps toward accurate reconstructions of phylogenies from gene-order data J Computer and System Sciences 2002, 65(3):508-525.