Back to Results
First PageMeta Content
Phylogenetics / NP-complete problems / Graph / Maximum parsimony / Routing algorithms / Tree / Phylogenetic network / Steiner tree problem / Directed acyclic graph / Graph theory / Mathematics / Theoretical computer science


Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access
Add to Reading List

Open Document

File Size: 354,93 KB

Share Result on Facebook

City

Berlin / Bronx / New York / /

Company

Kluge AG / Phylogenetic Networks / BioMed Central Ltd. / Google / Applications Cambridge University Press / Figure 1 Phylogenetic Networks / Creative Commons / /

Country

United States / /

Currency

pence / /

/

Facility

New York Botanical Garden / American Museum of Natural History / /

IndustryTerm

given network / possible networks / certain well-known algorithms / dynamic programming solution / given site / parsimonious network / tree/network / assigned network / dynamic programming algorithm / parsimony algorithms / linear-time heuristic algorithm / lower complexity solutions / exhaustive search / online submission / recombination network / ad hoc solution / heuristic solutions / /

Organization

Cambridge University / Graduate School / Defense Advanced Research Projects Agency / Division of Invertebrate Zoology / /

Person

Richard Gilder / /

/

Position

head of pk / /

ProvinceOrState

New York / /

PublishedMedium

Journal of Molecular Evolution / Annals of Human Genetics / Journal of Theoretical Biology / Natural History / Molecular Biology / /

Technology

dynamic algorithm / Bioinformatics / Q. Parsimony algorithms / Fitch algorithm / parsimony algorithms / dynamic programming algorithm / Molecular Evolution / Fitch algorithms / Sankoff algorithm / recombination / network The Fitch algorithm / linear-time heuristic algorithm / /

URL

http /

SocialTag