A learning algorithm for the longest common subsequence problem

A learning algorithm for the longest common subsequence problem (2000)

Cached

Download Links

[www.cs.unm.edu]
[www.cs.unm.edu]
[www.cs.rpi.edu]

Other Repositories/Bibliography

DBLP

by Eric A. Breimer , Mark K. Goldberg

Venue:	Proc. of the Second Workshop on Algorithm Engineering and Experiments, ALENEX
Citations:	4 - 3 self

BibTeX

@INPROCEEDINGS{Breimer00alearning,
    author = {Eric A. Breimer and Mark K. Goldberg},
    title = {A learning algorithm for the longest common subsequence problem},
    booktitle = {Proc. of the Second Workshop on Algorithm Engineering and Experiments, ALENEX},
    year = {2000},
    pages = {9610--5}
}

Bookmark

OpenURL

Abstract

Citations

1515	A Theory of the Learnable - Valiant - 1984
1094	Identification of common molecular subsequences - Smith, Waterman - 1981
537	The String-to-String Correction Problem - Wagner, Fischer - 1974
325	Time warps, string edits, and macromolecules: the theory and practice of sequence comparison - Sankoff, Kruskal - 1983
156	Algorithms for approximate string matching - Ukkonen - 1985
144	A faster algorithm for computing string edit distances - Masek, Paterson - 1980
137	Algorithms for the longest common subsequence problem - Hirschberg - 1977
134	TG: A Fast Algorithm for Computing Longest Common Subsequences - JW, Szymanski - 1977
63	M: On the Approximation of shortest common Supersequences and longest Common subsequences - Jiang, Li - 1995
18	A linear space algorithm for computing longest common subsequences - Hirschberg
17	Selected combinatorial research problems - Chvátal, Klarner, et al. - 1972
16	Upper bounds for expected length of a longest common subsequence of two random sequences - Dancik, Paterson - 1994
7	Path optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical - Berry, Goldberg
7	Experimenting an approximation algorithm for the LCS - Bonizzoni, Vedova, et al. - 1998
4	Approximation of the shortest common supersequence with ratio less than the alphabet size - Bonizzoni, Ehrenfeucht - 1996
4	An O(ND) di erence algorithm and its variations - Myers - 1986
3	Designing Algorithms by Sampling - Goldberg, Hollinger - 1998
1	Case study of a learning algorithm for the longest common subsequence problem - Breimer, Goldberg - 1998
1	Upper bounds for the expected length of a longest common subsequence of two binary sequences - ik, V, et al. - 1994
1	Workshop on Algorithm Engineering and Experiments 156 Eric - Second - 1995
1	A longest common subsequenc algorithm suitable for similar text strings - Nakatsu, Kambayashi, et al. - 1982