Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search
暂无分享,去创建一个
Oliver Eulenstein | Mukul S. Bansal | John Gordon Burleigh | André Wehe | J. G. Burleigh | O. Eulenstein | M. Bansal | A. Wehe
[1] J. Thompson,et al. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. , 1994, Nucleic acids research.
[2] M. Steel,et al. Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .
[3] Jerzy Tiuryn,et al. On the Structure of Reconciliations , 2004, Comparative Genomics.
[4] Ulrike Stege,et al. Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable , 1999, WADS.
[5] J. G. Burleigh,et al. Prospects for Building the Tree of Life from Large Sequence Databases , 2004, Science.
[6] Roderic D. M. Page,et al. Vertebrate Phylogenomics: Reconciled Trees and Gene Duplications , 2001, Pacific Symposium on Biocomputing.
[7] Michael R. Fellows,et al. Analogs and Duals of the MAST Problem for Sequences and Trees , 1998, ESA.
[8] Michael T. Hallett,et al. New algorithms for the duplication-loss model , 2000, RECOMB '00.
[9] Bin Ma,et al. On reconstructing species trees from gene trees in term of duplications and losses , 1998, RECOMB '98.
[10] G. Moore,et al. Fitting the gene lineage into its species lineage , 1979 .
[11] Michael R. Fellows,et al. Analogs & duals of the MAST problem for sequences & trees , 2003, J. Algorithms.
[12] G. Italiano,et al. Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .
[13] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[14] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[15] Louxin Zhang,et al. On a Mirkin-Muchnik-Smith Conjecture for Comparing Molecular Phylogenies , 1997, J. Comput. Biol..
[16] Roderic D. M. Page,et al. Tangled Tales from Multiple Markers , 2004 .
[17] Charles Semple,et al. On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .
[18] Temple F. Smith,et al. Reconstruction of ancient molecular phylogeny. , 1996, Molecular phylogenetics and evolution.
[19] Paola Bonizzoni,et al. Reconciling Gene Trees to a Species Tree , 2003, CIAC.
[20] A. Knight,et al. Inferring species trees from gene trees: a phylogenetic analysis of the Elapidae (Serpentes) based on the amino acid sequences of venom proteins. , 1997, Molecular phylogenetics and evolution.
[21] M. Sanderson,et al. Inferring angiosperm phylogeny from EST data with widespread gene duplication , 2007, BMC Evolutionary Biology.
[22] D. Swofford. PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10 , 2002 .
[23] Roderic D. M. Page,et al. GeneTree: comparing gene and species phylogenies using reconciled trees , 1998, Bioinform..
[24] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.
[25] Dannie Durand,et al. NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees , 2000, J. Comput. Biol..
[26] Ilya B. Muchnik,et al. A Biologically Consistent Model for Comparing Molecular Phylogenies , 1995, J. Comput. Biol..
[27] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[28] R. Page. Maps between trees and cladistic analysis of historical associations among genes , 1994 .
[29] R. Page. Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. , 2000, Molecular phylogenetics and evolution.