A fast algorithm for computing longest common subsequences 论文

1977Communications of the ACM引用 691
DOIPDF
Algorithms and Data CompressionGenome Rearrangement Algorithmssemigroups and automata theory
Algorithms and Data CompressionGenome Rearrangement Algorithmssemigroups and automata theory
相关技术:Genome Rearrangement AlgorithmsAlgorithms and Data Compression
关系图谱

A fast algorithm for computing longest common subsequences · 作者

T

Thomas G. Szymanski

J

James Hunt