Abstract
A new problem in sequence comparison, given a set of strings S1, S2 ... Sc and a target string T Si = BiY Fi is introduced. Y is the subsequence common to all of strings Si. The goal is to compute similarity of all strings Si with T, without computing the part of Y again and again. How to reduce the O(nl) runtime work for the common subsequence Y in each string to O(n), at the cost of only O(n2+nl) work at preprocessing time, where n is target size and l is the size of Y.
Original language | English |
---|---|
Pages | 804-814 |
Number of pages | 11 |
State | Published - 1 Jan 2000 |
Externally published | Yes |
Event | 11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 9 Jan 2000 → 11 Jan 2000 |
Conference
Conference | 11th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
City | San Francisco, CA, USA |
Period | 9/01/00 → 11/01/00 |
ASJC Scopus subject areas
- Software
- General Mathematics