@Article{roch06short,
  author    = {Sebastien Roch},
  title     = {A short proof that phylogenetic tree reconstruction by maximum likelihood is hard.},
  journal   = TCBB,
  year      = {2006},
  volume    = {3},
  number    = {1},
  pages     = {92--94},
  abstract  = {Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel.},
  doi       = {10.1109/TCBB.2006.4},
  keywords  = {Computer Simulation; Genetics, Population; Likelihood Functions; Phylogeny; Recombination; Sequence Analysis, DNA},
  owner     = {Sebastian},
  pmid      = {17048396},
  timestamp = {2006.12.29},
}

{"_id":"3PHysQcgPc2wqJyQR","bibbaseid":"roch-ashortproofthatphylogenetictreereconstructionbymaximumlikelihoodishard-2006","authorIDs":[],"author_short":["Roch, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Sebastien"],"propositions":[],"lastnames":["Roch"],"suffixes":[]}],"title":"A short proof that phylogenetic tree reconstruction by maximum likelihood is hard.","journal":"IEEE/ACM Trans Comput Biology Bioinform","year":"2006","volume":"3","number":"1","pages":"92–94","abstract":"Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel.","doi":"10.1109/TCBB.2006.4","keywords":"Computer Simulation; Genetics, Population; Likelihood Functions; Phylogeny; Recombination; Sequence Analysis, DNA","owner":"Sebastian","pmid":"17048396","timestamp":"2006.12.29","bibtex":"@Article{roch06short,\n author = {Sebastien Roch},\n title = {A short proof that phylogenetic tree reconstruction by maximum likelihood is hard.},\n journal = TCBB,\n year = {2006},\n volume = {3},\n number = {1},\n pages = {92--94},\n abstract = {Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel.},\n doi = {10.1109/TCBB.2006.4},\n keywords = {Computer Simulation; Genetics, Population; Likelihood Functions; Phylogeny; Recombination; Sequence Analysis, DNA},\n owner = {Sebastian},\n pmid = {17048396},\n timestamp = {2006.12.29},\n}\n\n","author_short":["Roch, S."],"key":"roch06short","id":"roch06short","bibbaseid":"roch-ashortproofthatphylogenetictreereconstructionbymaximumlikelihoodishard-2006","role":"author","urls":{},"keyword":["Computer Simulation; Genetics","Population; Likelihood Functions; Phylogeny; Recombination; Sequence Analysis","DNA"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.577Z","downloads":0,"keywords":["computer simulation; genetics","population; likelihood functions; phylogeny; recombination; sequence analysis","dna"],"search_terms":["short","proof","phylogenetic","tree","reconstruction","maximum","likelihood","hard","roch"],"title":"A short proof that phylogenetic tree reconstruction by maximum likelihood is hard.","year":2006,"dataSources":["C5FtkvWWggFfMJTFX"]}