Towards a better solution to the shortest common supersequence problem: The deposition and reduction algorithm
10.1109/IMSCCS.2006.136
Saved in:
Main Authors: | Ning, K., Leong, H.W. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/41639 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Towards a better solution to the shortest common supersequence problem: The deposition and reduction algorithm
by: Ning, K., et al.
Published: (2013) -
Finding patterns in biological sequences by longest common subsequences and shortest common supersequences
by: Ning, K., et al.
Published: (2013) -
Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences
by: Ning, K., et al.
Published: (2013) -
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
by: Aggarwal, Divesh, et al.
Published: (2021) -
The distribution and deposition algorithm for multiple oligo nucleotide arrays.
by: Ning, K., et al.
Published: (2013)