Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ECAI
/
Paper
An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem.
Gaofeng Huang
,
Andrew Lim
Venue
A
ECAI
Year
2004
Proceedings
ECAI
DBLP record
conf/ecai/HuangL04 ↗
Browse the full
ECAI paper archive
.