The gene-duplication problem: Near-linear time algorithms for NNI based local searches

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4983 LNBI, Issue , 2008, Pages 14-25

  Bansal, Mukul S ^a   Eulenstein, Oliver ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOCOMMUNICATIONS; BIOINFORMATICS; CHLORINE COMPOUNDS; HEURISTIC PROGRAMMING; INFORMATION SCIENCE; NUCLEAR PROPULSION; TREES (MATHEMATICS);

EXACT SOLUTIONS; GENE DUPLICATIONS; GENE TREES; GENE-DUPLICATION PROBLEM; INTERNATIONAL SYMPOSIUM; LOCAL SEARCH; NEAR-LINEAR TIME; NEAREST NEIGHBORS; NP-COMPLETE; PHYLOGENETIC ANALYSIS; SEARCH PROBLEMS; SEARCH SPACES; SPEED UPS; SUPERTREE; TREE SPACE;

HEURISTIC METHODS;

EID: 49949102302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79450-9_3     Document Type: Conference Paper

References (29)

1. Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5, 1-13 (2001)
2. Bansal, M.S., Burleigh, J.G., Eulenstein, O., Wehe, A.: Heuristics for the gene-duplication problem: A Θ(n) speed-up for the local search. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 238-252. Springer, Heidelberg (2007)
3. 2/logn) speed-up of TBR heuristics for the geneduplication problem. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol. 4645, pp. 124-135. Springer, Heidelberg (2007)
4. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
5. Bonizzoni, P., Vedova, G.D., Dondi, R.: Reconciling a gene tree to a species tree under the duplication cost model. Theor. Comput. Sci. 347(1-2), 36-53 (2005)
6. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8,409-423 (2004)
7. Chen, K., Durand, D., Farach-Colton, M.: Notung: a program for dating gene duplications and optimizing gene family trees. Journal of Computational Biology 7, 429-447 (2000)
8. Cotton, J.A., Page, R.D.M.: Tangled tales from multiple markers: reconciling conflict between phylogenies to build molecular supertrees. In: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, pp. 107-125. Springer, Heidelberg (2004)
9. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: SODA, pp. 427-436 (1997)
10. Fellows, M., Hallett, M., Korostensky, C., Stege, U.: Analogs and duals of the mast problem for sequences and trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 103-114. Springer, Heidelberg (1998)
11. Ganapathy, G., Ramachandran, V., Warnow, T.: Better hill-climbing searches for parsimony. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 245-258. Springer, Heidelberg (2003)
12. Ganapathy, G., Ramachandran, V., Warnow, T.: On contract-and-refine transformations between phylogenetic trees. In: SODA, pp. 900-909 (2004)
13. Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage. a parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology 28, 132-163 (1979)
14. Górecki, P., Tiuryn, J.: On the structure of reconciliations. In: Lagergren, J. (ed.) RECOMBWS 2004. LNCS (LNBI), vol. 3388, pp. 42-54. Springer, Heidelberg (2005)
15. Guigó, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient molecular phylogeny. Molecular Phylogenetics and Evolution 6(2), 189-213 (1996)
16. Hallett, M.T., Lagergren, J.: New algorithms for the duplication-loss model. In: RECOMB, pp. 138-146 (2000)
17. Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM J. Comput. 30(3), 729-752 (2000)
18. Mirkin, B., Muchnik, I., Smith, T.F.: A biology consistent model for comparing molecular phylogenies. Journal of Computational Biology 2(4), 493-507 (1995)
19. Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology 43(1), 58-77 (1994)
20. Page, R.D.M.: GeneTree: comparing gene and species phylogenies using reconciled trees. Bioinformatics 14(9), 819-820 (1998)
21. Page, R.D.M.: Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. Molecular Phylogenetics and Evolution 14, 89-106 (2000)
22. Page, R.D.M., Charleston, M.A.: From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem. Molec. Phyl. and Evol. 7, 231-240 (1997)
23. Page, R.D.M., Cotton, J.: Vertebrate phylogenomics: reconciled trees and gene duplications. In: Pacific Symposium on Biocomputing, pp. 536-547 (2002)
24. Page, R.D.M., Holmes, E.C.: Molecular evolution: a phylogenetic approach. Blackwell Science, Maiden (1998)
25. Sanderson, M.J., McMahon, M.M.: Inferring angiosperm phylogeny from EST data with widespread gene duplication. BMC Evolutionary Biology 7 (suppl. 1), 3 (2007)
26. Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)
27. Slowinski, J.B., Knight, A., Rooney, A.P.: Inferring species trees from gene trees: A phylogenetic analysis of the elapidae (serpentes) based on the amino acid sequences of venom proteins. Molecular Phylogenetics and Evolution 8, 349-362 (1997)
28. Stege, U.: Gene trees and species trees: The gene-duplication problem in fixed-parameter tractable. In: WADS, pp. 288-293 (1999)
29. Zhang, L.: On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. Journal of Computational Biology 4(2), 177-187 (1997)