Finding Patterns in Biological Sequences by Longest Common Subsequencesand Shortest Common Supersequences

Authors:
Kang Ning;Hoong Kee Ng;Hon Wai Leong
Affiliations:
National University of Singapore;National University of Singapore;National University of Singapore
Venue:
BIBE '06 Proceedings of the Sixth IEEE Symposium on BionInformatics and BioEngineering
Year:
2006

Citing 0
Cited 2

LogSig: generating system events from raw textual logs

Proceedings of the 20th ACM international conference on Information and knowledge management
The constrained shortest common supersequence problem

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Patterns in biological sequences are important for revealing the relationship among biological sequences. Much research has been done on this problem, and the sensitivity and specificity of current algorithms are already quite satisfactory. However, in general, for problems on a set of sequences, the relationship among their patterns, their Longest Common Subsequences (LCS) and their Shortest Common Supersequences (SCS) are not examined carefully. Therefore, revealing the relationship between the patterns and LCS/SCS might provide us with a deeper view of the patterns of biological sequences, in turn leading to a better understanding of them. In this paper, we propose the PALS (PAtterns by Lcs and Scs) algorithms to discover patterns in a set of biological sequences by first generating the results for LCS and SCS of sequences by heuristic, and consequently derive the patterns from these results. Experiments show that the PALS algorithms perform well (both in efficiencies and in accuracies) on a variety of sequences.