An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree

✍ Scribed by B.Y. Wu; C.Y. Tang

• Book ID: 104137444
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 477 KB
• Volume: 63
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/s0020-0190(97)00109-9

✦ Synopsis

An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree is presented in this paper. The optimality of position is defined by minimum incremental distance under Lx-norm. The algorithm can also be used to solve similar problems with alternative criteria, such as L'-norm or minimum tree size.