ON THE PROBLEM OF DISCOVERING THE MOST PARSIMONIOUS TREE

摘要: The problem of discovering the most parsimonious tree is defined in terms a set linearly arrayed sequences. Simplifications are introduced to reduce total amount work including elimination uninformative positions and recognition equivalent positions. procedure can be applied any array sequences, amino acid. It shown, however, that failure convert such through genetic code, into nucleotide sequences very wasteful pertinent information. Parsimony shown as minimizes discordancies (parallel and]or back substitutions). A (a discordancy diagram) given enables one recognize when two characters (nucleotide positions) will necessitate acceptance how many, at least, unavoidable. Subtraction these unavoidable from matrix potential leads avoidable generally give least pairs taxa ...