| 
|
Quote: shortest edit sequence by removing longest prefixes
topics >
all references >
references t-z >
Topic:
data compression algorithms
Quotation Skeleton
A surprisingly simple algorithm does the job [of building a shortest edit sequence]. Start at the left end of the target string T, … S, remove the first symbol from T and … move. Then remove the matched prefix from T … the beginning of S. This process continues until … [p. 318] An edit script that reconstructs target string … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: data compression algorithms (53 items)