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

B.Y. Wu; C.Y. Tang

doi:10.1016/s0020-0190(97)00109-9

Back

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

Journal article

Peer reviewed

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

B.Y. Wu and C.Y. Tang

Information Processing Letters, Vol.63(5), pp.263-269

09/1997

DOI: https://doi.org/10.1016/s0020-0190(97)00109-9

Abstract

Algorithms

Computational biology

Evolutionary tree

Theoretical Computer Science

Signal Processing

Information Systems

Computer Science Applications

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 L ^∞ -norm. The algorithm can also be used to solve similar problems with alternative criteria, such as L ¹ -norm or minimum tree size. © 1997 Elsevier Science B.V.

Metrics

1 Record Views

Details

Title: An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree
Translated title: An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree
Creators - without role: B.Y. Wu - National Tsing Hua University
C.Y. Tang - National Tsing Hua University
Publication Details: Information Processing Letters, Vol.63(5), pp.263-269
Identifiers: 9957769377206774
Academic Unit: National Tsing Hua University
Language: English
Resource Type: Journal article

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

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media