@inbook{10.2307/j.ctt9qf9j4.9,
ISBN = {9780262027526},
URL = {http://www.jstor.org/stable/j.ctt9qf9j4.9},
abstract = {In chapter 3 we introducedRmin(M), the minimum number of recombination nodes used in any ARG to derive the set of sequencesM, and we noted that the problem of computingRmin(M) is known to be NP-hard. Hence no provably correct, worst-case polynomial-time algorithm is known for computingRmin(M), and we do not expect there will be one. However, several worst-case polynomial-time algorithms have been developed that compute empirically goodlower boundsonRmin(M), and there are several other lower-bound methods whose worst case time is not polynomially bounded, but are fast in practice. Some of the lower bounds apply},
author = {Charles H. Langley and Yun S. Song and Yufeng Wu},
bookauthor = {Dan Gusfield},
booktitle = {ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks},
pages = {127--176},
publisher = {MIT Press},
title = {First Bounds},
year = {2014}
}