发现好书期刊,享受阅读乐趣

海量图书期刊资源,随时随地畅享阅读乐趣

Algorithms for computing variants of the longest common subsequence problem

Algorithms for computing variants of the longest common subsequence problem

Costas S. Iliopoulos; M. Sohel Rahman
  • 作者Costas S. Iliopoulos; M. Sohel Rahman
  • 卷第395卷
  • 印刷ISSN0304-3975
  • 文件大小405.28KB
  • 发表时间2008
  • DOI10.1016/j.tcs.2008.01.009
  • 页码255-267
← 返回【学霸图书馆】主页