| 
|
Quote: a fast and practical bit-vector algorithm for length of longest common subsequence
topics >
all references >
references c-d >
Topic:
string operations
Quotation Skeleton
This paper presents a new practical bit-vector algorithm … [the length of] … n>= m, we present an algorithm which determines … number of bits in a machine word. … Our algorithm is very efficient in practice where … constant … work by assuming that m<=w. … [p. 280] The column-wise addition [of our algorithm] … can keep track of previous LCS so that … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: string operations (20 items)