Abstract
Motivated by the problem of finding similarities in DNA and amino acid sequences, we study a particular class of two dimensional interval graphs and present an algorithm that finds a maximum weight "increasing" independent set for this class. Our class of interval graphs is a subclass of the graphs with interval number 2. The algorithm we present runs in O(n log n) time, where n is the number of nodes, and its implementation provides-a practical solution to a common problem in genetic sequence comparison.
Cite
CITATION STYLE
Joseph, D., Meidanis, J., & Tiwari, P. (1992). Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 621 LNCS, pp. 326–337). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
