|
Volumn 23, Issue 6, 1994, Pages 1216-1224
|
Polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
BINARY SEQUENCES;
CHARACTER SETS;
COMPUTATIONAL COMPLEXITY;
MATRIX ALGEBRA;
POLYNOMIALS;
TREES (MATHEMATICS);
VECTORS;
CHARACTER COMPATIBILITY;
EVOLUTION;
PERFECT PHYLOGENY;
POLYNOMIAL TIME ALGORITHM;
ALGORITHMS;
|
EID: 0028750140
PISSN: 00975397
EISSN: None
Source Type: Journal
DOI: 10.1137/S0097539793244587 Document Type: Article |
Times cited : (81)
|
References (20)
|