On the shared substring alignment problem

Authors:
Gad M. Landau;Michal Ziv-Ukelson
Affiliations:
Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY and Department of Computer Science, Haifa University, Haifa 31905, Israel;Department of Computer Science, Haifa University, Haifa 31905, Israel
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 2
Cited 4

Incremental String Comparison

SIAM Journal on Computing
A linear space algorithm for computing maximal common subsequences

Communications of the ACM

A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse LCS common substring alignment

Information Processing Letters
Two algorithms for LCS Consecutive Suffix Alignment

Journal of Computer and System Sciences
Sparse LCS common substring alignment

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

Quantified Score

Hi-index	0.00

Visualization

Abstract