Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AAIM
/
Paper
A New Efficient Algorithm for Computing the Longest Common Subsequence.
M. Sohel Rahman
,
Costas S. Iliopoulos
Venue
C
AAIM
Year
2007
Proceedings
AAIM
DBLP record
conf/aaim/RahmanI07 ↗
Browse the full
AAIM paper archive
.