### Abstract

Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

Original language | English |
---|---|

Pages (from-to) | 563-574 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science |

Volume | 3623 |

Publication status | Published - 2005 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Lecture Notes in Computer Science*,

*3623*, 563-574.

**Fully incremental LCS computation.** / Ishida, Yusuke; Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki.

Research output: Contribution to journal › Article

*Lecture Notes in Computer Science*, vol. 3623, pp. 563-574.

}

TY - JOUR

T1 - Fully incremental LCS computation

AU - Ishida, Yusuke

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

PY - 2005

Y1 - 2005

N2 - Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

AB - Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

UR - http://www.scopus.com/inward/record.url?scp=26844489395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844489395&partnerID=8YFLogxK

M3 - Article

VL - 3623

SP - 563

EP - 574

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -