A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
about
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
description
2014 nî lūn-bûn
@nan
2014 թուականի Նոյեմբերին հրատարակուած գիտական յօդուած
@hyw
2014 թվականի նոյեմբերին հրատարակված գիտական հոդված
@hy
2014年の論文
@ja
2014年論文
@yue
2014年論文
@zh-hant
2014年論文
@zh-hk
2014年論文
@zh-mo
2014年論文
@zh-tw
2014年论文
@wuu
name
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@ast
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@en
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@nl
type
label
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@ast
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@en
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@nl
prefLabel
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@ast
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@en
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@nl
P2093
P2860
P1476
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
@en
P2093
Guoliang Chen
Jiaoyun Yang
P2860
P304
P356
10.1109/TKDE.2014.2304464
P577
2014-11-01T00:00:00Z