Obtaining maximal concatenated phylogenetic data sets from large sequence databases

Michael J. Sanderson, Amy C. Driskell, Richard H. Ree, Oliver Eulenstein, Sasha Langley

Research output: Contribution to journalArticle

76 Scopus citations

Abstract

To improve the accuracy of tree reconstruction, phylogeneticists are extracting increasingly large multigene data sets from sequence databases. Determining whether a database contains at least k genes sampled from at least m species is an NP-complete problem. However, the skewed distribution of sequences in these databases permits all such data sets to be obtained in reasonable computing times even for large numbers of sequences. We developed an exact algorithm for obtaining the largest multigene data sets from a collection of sequences. The algorithm was then tested on a set of 100,000 protein sequences of green plants and used to identify the largest multigene ortholog data sets having at least 3 genes and 6 species. The distribution of sizes of these data sets forms a hollow curve, and the largest are surprisingly small, ranging from 62 genes by 6 species, to 3 genes by 65 species, with more symmetrical data sets of around 15 taxa by 15 genes. These upper bounds to sequence concatenation have important implications for building the tree of life from large sequence databases.

Original languageEnglish (US)
Pages (from-to)1036-1042
Number of pages7
JournalMolecular biology and evolution
Volume20
Issue number7
DOIs
StatePublished - Jul 1 2003

    Fingerprint

Keywords

  • Biclique
  • NP-complete
  • Optimization
  • Phylogeny
  • Sequence concatenation

ASJC Scopus subject areas

  • Ecology, Evolution, Behavior and Systematics
  • Molecular Biology
  • Genetics

Cite this