|
Volumn 3692 LNBI, Issue , 2005, Pages 65-76
|
A lookahead branch-and-bound algorithm for the maximum quartet consistency problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTER SCIENCE;
DATA PROCESSING;
PROBLEM SOLVING;
TIME DOMAIN ANALYSIS;
BRANCH-AND-BOUND ALGORITHM (LBNB);
MAXIMUM QUARTET CONSISTENCY (MQC) PROBLEM;
NP-HARD;
PHYLOGENY;
ALGORITHMS;
|
EID: 33646180219
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/11557067_6 Document Type: Conference Paper |
Times cited : (8)
|
References (17)
|