Exact solutions for classic gene tree parsimony problems

5th International Conference on Bioinformatics and Computational Biology 2013, BICoB 2013

Volumn , Issue , 2013, Pages 225-230

  Chang, Wen Chieh ^a   Wehe, André ^b   Górecki, Paweł ^c   Eulenstein, Oliver ^a  

^a Iowa State University   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-VECTOR REPRESENTATION; EVOLUTIONARY EVENTS; EVOLUTIONARY HISTORY; EXACT ALGORITHMS; EXACT SOLUTION; GENE DUPLICATIONS; OPTIMAL SOLUTIONS; PERFORMANCE GUARANTEES;

BIOINFORMATICS; EVOLUTIONARY ALGORITHMS; FORESTRY; GENES;

PROBLEM SOLVING;

ALGORITHMS; FORESTRY; GENES; INFORMATION RETRIEVAL; PROBLEM SOLVING;

EID: 84883637223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. L. Arvestad, A. Berglund, J. Lagergren, and B. Sennblad. "Bayesian gene/species tree reconciliation and orthology analysis using MCMC,". Bioin-formatics, 19(suppl 1):i7-i15, 2003.
2. M. S. Bansal, J. G. Burleigh, and O. Eulenstein. "Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models,". BMC Bioinf., 11(Suppl 1):S42, 2010.
3. M. S. Bansal and R. Shamir. "A note on the fixed parameter tractability of the gene-duplication problem,". IEEE/ACM Trans. Comput. Biol. Bioinf., 8(3):848-850, 2011.
4. G. Blin, P. Bonizzoni, R. Dondi, R. Rizzi, and F. Sikora. "Complexity insights of the minimum duplication problem,". SOFSEM 2012: Theory and Practice of Computer Science, pages 153-164, 2012.
5. D. Brown and I. Harrower. "Integer programming approaches to haplotype inference by pure parsimony,". IEEE/ACM Trans. Comput. Biol. Bioinf., 3(2):141-154, 2006.
6. W.-C. Chang, J. G. Burleigh, D. Fernández-Baca, and O. Eulenstein. "An ILP solution for the gene duplication problem,". BMC Bioinf., 12(Suppl 1):S14, 2011.
7. R. Chaudhary, M. S. Bansal, A. Wehe, D. Fernández-Baca, and O. Eulenstein. "iGTP: A software package for large-scale gene tree parsimony analysis,". BMC Bioinf., 11(1):574, 2010.
8. M. Chimani, S. Rahmann, and S. Böcker. "Exact ILP solutions for phylogenetic minimum flip problems,". In Proceedings of ACM-BCB 2010, pages 147-153. ACM, 2010.
9. J. Cotton and R. Page. "Going nuclear: gene family evolution and vertebrate phylogeny reconciled,". Proc. R. Soc. London, Ser. B, 269(1500):1555-1561, 2002.
10. J. Cotton and M. Wilkinson. "Majority-rule supertrees,". Syst. Biol., 56(3):445-452, 2007.
11. J. Doyon and C. Chauve. "Branch-and-bound approach for parsimonious inference of a species tree from a set of gene family trees,". Software Tools and Algorithms for Biological Systems, pages 287-295, 2011.
12. M. Goodman, J. Czelusniak, G. Moore, A. Romero-Herrera, and G. Matsuda. "Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences,". Syst. Biol., 28(2):132-163, 1979.
13. P. Górecki and J. Tiuryn. "Inferring phylogeny from whole genomes,". Bioinformatics, 23(2):e116-e122, 2007.
14. R. Guigo, I. Muchnik, and T. Smith. "Reconstruction of ancient molecular phylogeny,". Mol. Phylogenet. Evol., 6(2):189-213, 1996.
15. D. Gusfield, Y. Frid, and D. Brown. "Integer programming formulations and computations solving phylo-genetic and population genetic problems with missing or genotypic data,". Computing and Combinatorics, pages 51-64, 2007.
16. D. Knuth. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Professional, 2005.
17. B. Ma, M. Li, and L. Zhang. "On reconstructing species trees from gene trees in term of duplications and losses,". In Proceedings of RECOMB 98, pages 182-191. ACM, 1998.
18. B. Ma, M. Li, and L. Zhang. "From gene trees to species trees,". SIAM Journal on Computing, 30(3):729-752, 2001.
19. W. Maddison and L. Knowles. "Inferring phylogeny despite incomplete lineage sorting,". Syst. Biol., 55(1):21-30, 2006.
20. W. Maddison and D. Maddison. "Mesquite: a modular system for evolutionary analysis,". Evolution, 62(5):1103-1118, 2008.
21. R. Page. "Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny,". Mol. Phylogenet. Evol., 14(1):89-106, 2000.
22. R. Page and M. Charleston. "Reconciled trees and incongruent gene and species trees,". Mathematical Hierarchies in Biology, 37:57-70, 1997.
23. M. Sanderson and M. McMahon. "Inferring an-giosperm phylogeny from EST data with widespread gene duplication,". BMC Evol. Biol., 7(Suppl 1):S3, 2007.
24. J. Slowinski and R. Page. "How should species phylo-genies be inferred from sequence data?,". Syst. Biol., 48(4):814-825, 1999.
25. C. Than and L. Nakhleh. "Species tree inference by minimizing deep coalescences,". PLoS Comput. Biol., 5(9):e1000501, 2009.
26. A. Wehe, M. S. Bansal, J. G. Burleigh, and O. Eulenstein. "DupTree: a program for large-scale phyloge-netic analyses using gene tree parsimony,". Bioinfor-matics, 24(13):1540-1541, 2008.
27. A. Wehe, J. G. Burleigh, and O. Eulenstein. "Algorithms for knowledge-enhanced supertrees,". In Proceedings of ISBRA 2012, pages 263-274, 2012.
28. L. Zhang. "From gene trees to species trees II: Species tree inference by minimizing deep coalescence events,". IEEE/ACM Trans. Comput. Biol. Bioinf., 8(6):1685-1691, 2011.