مرکز منطقه ای اطلاع رساني علوم و فناوري - An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees

Title of article :

An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees

Author/Authors :

Z.S. Peng، نويسنده , , H.F. Ting، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2006

Pages :

From page :

137

To page :

144

Keywords :

Phylogenetic analysis , Design of algorithms , Maximum agreement subtree

Journal title :

Information Processing Letters

Serial Year :

2006

Journal title :

Information Processing Letters

Record number :

130329

Link To Document :