2 citations · 6 across the 7 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
q-bio.PE2011
Walks on SPR Neighborhoods
Alan Joseph J. Caceres, Juan Castillo, Jinnie Lee +1
A nearest-neighbor-interchange (NNI) walk is a sequence of unrooted phylogenetic trees, T_0, T_1, T_2,... where each consecutive pair of trees differ by a single NNI move. We give…
q-bio.PE2011
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility
Maria Luisa Bonet, Simone Linz, Katherine St. John
We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide…