H. Goeman, M. Clausen  Home/Search
Context
Related
| mmdb.iai.unibonn.de/./do...pscwlcs.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mmdb.iai.unibo...ublications.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths m and n, m, on an alphabet of size s, we first present an algorithm which determines the length p of an LCS in O(ns + min{mp, p(n p)}) time and O(ns) space. (Update)
Active bibliography (related documents): More All
1.3: Expected Length of Longest Common Subsequences - Dancík (Correct)
1.3: Longest Common Subsequences - Paterson, Dancik (1994) (Correct)
1.1: Time and Space Efficient Algorithms for Decomposing Certain.. - Goeman (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@inproceedings{ goeman99new,
author = "H. Goeman and M. Clausen",
title = "A new practical linear space algorithm for the longest common subsequence problem",
booktitle = "Proceedings of {thePrague} Stringology Club Workshop~'99",
address = "Czech Technical University, Prague, Czech Republic",
editor = "J. Holub and M. {\v S}im{\' a}nek",
pages = "40--60",
year = "1999",
url = "citeseer.ist.psu.edu/749731.html" }
Citations (may not include all citations):270 The string--to--string correction problem (context) - Wagner, Fischer - 1974
247 A general method applicable to the search for similarities i.. (context) - Needleman, Wunsch - 1970
108 A decomposition theorem for partially ordered sets (context) - Dilworth - 1950
92 Algorithms for approximate string matching (context) - Ukkonen - 1985
79 A linear space algorithm for computing maximal common subseq.. (context) - Hirschberg - 1975
69 A faster algorithm for computing string edit distances (context) - Masek, Paterson - 1980
61 A fast algorithm for computing longest common subsequences (context) - Hunt, Szymanski - 1977
57 Algorithms for the longest common subsequence problem (context) - Hirschberg - 1977
57 The complexity of some problem on subsequences and supersequ.. (context) - Maier - 1978
47 An extension of the string--to--string correction problem (context) - Lowrance, Wagner - 1975
38 and Macromolecules: The Theory And Practice of Sequence Comp.. (context) - Kruskal, Time et al. - 1983
35 The longest common subsequence problem revisited (context) - Apostolico, Guerra - 1987
28 Bounds on the complexity of the longest common subsequence p.. (context) - Aho, Hirschberg et al. - 1976
24 On finding minimal length superstrings (context) - Gallant, Maier et al. - 1980
24 A sentence--to--sentence clustering procedure for pattern an.. (context) - Lu, Fu - 1978
19 the complexity of the extended string--to--string correction.. (context) - Wagner - 1975
17 Longest common subsequences - Paterson, Danck - 1994
16 Bounds for the string editing problem (context) - Wong, Chandra - 1976
16 sequence comparison algorithm (context) - Wu, Manber et al. - 1990
15 erence algorithm and its variations (context) - Myers, An - 1986
14 A longest common subsequence algorithm suitable for similar .. (context) - Nakatsu, Kambayashi et al. - 1982
13 Some limit results for longest common subsequences (context) - Deken - 1979
12 A new flexible algorithm for the longest common subsequence .. (context) - Rick - 1995
11 New algorithms for the LCS problem (context) - Hsu, Du - 1984
10 Fast linear--space computations of longest common subsequenc.. (context) - Apostolico, Browne et al. - 1992
8 Improving the worst--case performance of the Hunt-- Szymansk.. (context) - Apostolico - 1986
6 A linear space algorithm for the LCS problem (context) - Kumar, Rangan - 1987
5 A fast algorithm for computing longest common subsequences o.. (context) - Chin, Poon - 1990
4 Remarks on the Hsu--Du new algorithm for the longest common .. (context) - Apostolico - 1987
3 Longest common subsequences of two random strings (context) - Chvatal, Sanko - 1975
3 Tree systems for syntactic pattern recognition (context) - Fu, Bhargava - 1973
2 New algorithms for the longest common subsequence problem - Rick - 1994
2 A test for nucleotide sequence homology (context) - Cedergren - 1973
1 Upper bounds for the expected length of a longest common sub.. (context) - Danck, Paterson - 1994
Documents on the same site (http://www-mmdb.iai.uni-bonn.de/publications.php): More
Content-based Retrieval in MIDI and Audio - Clausen, Kurth, Engelbrecht (2001) (Correct)
Time and Space Efficient Algorithms for Decomposing Certain.. - Goeman (Correct)
On Parsing and Condensing Substrings of LR Languages in Linear Time - Goeman (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC