|
Volumn , Issue , 1998, Pages 436-445
|
Evolutionary trees can be learned in polynomial time in the Two-State General Markov Model
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
LEARNING ALGORITHMS;
LEARNING SYSTEMS;
MATHEMATICAL MODELS;
POLYNOMIALS;
PROBABILITY;
TREES (MATHEMATICS);
CAVENDER-FARRIES-NEYMAN MODEL;
TWO-STATE MARKOV EVOLUTIONARY TREES;
MARKOV PROCESSES;
|
EID: 0032306364
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (13)
|
References (14)
|