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

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

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

Jean-Frédéric Myoupo; David Semé

作者Jean-Frédéric Myoupo; David Semé
卷第57卷
期第2期
印刷ISSN0743-7315
电子ISSN1096-0848
文件大小134.84KB
发表时间1999
DOI10.1006/jpdc.1999.1534
页码212-223

← 返回【学霸图书馆】主页