Please use this identifier to cite or link to this item:
|Title:||Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences|
Longest common subsequences
Shortest common supersequences
|Citation:||Ning, K., Ng, H.K., Leong, H.W. (2011). Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences. International Journal of Data Mining and Bioinformatics 5 (6) : 611-625. ScholarBank@NUS Repository. https://doi.org/10.1504/IJDMB.2011.045413|
|Abstract:||For a set of multiple sequences, their patterns, Longest Common Subsequences (LCS) and Shortest Common Supersequences (SCS) represent different aspects of these sequences- profile. Revealing the relationship between the patterns and LCS/SCS might provide us with a deeper view of the patterns. In this paper, we have showed that patterns LCS and SCS were closely related to each other. Based on their relations, the PALS algorithms are proposed to discover patterns in a set of biological sequences based on LCS and SCS results. Experiments show that the PALS algorithms are superior in efficiency and accuracy on a variety of sequences. Copyright © 2011 Inderscience Enterprises Ltd.|
|Source Title:||International Journal of Data Mining and Bioinformatics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.