Please use this identifier to cite or link to this item:
|Title:||Finding patterns in biological sequences by longest common subsequences and shortest common supersequences|
|Citation:||Ning, K.,Ng, H.K.,Leong, H.W. (2006). Finding patterns in biological sequences by longest common subsequences and shortest common supersequences. Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006 : 53-60. ScholarBank@NUS Repository. https://doi.org/10.1109/BIBE.2006.253315|
|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. © 2006 IEEE.|
|Source Title:||Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.