Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
Algorithms for Computing Variants of the Longest Common Subsequence Problem.
M. Sohel Rahman
,
Costas S. Iliopoulos
Venue
B
ISAAC
Year
2006
Proceedings
ISAAC
DBLP record
conf/isaac/RahmanI06 ↗
Browse the full
ISAAC paper archive
.