PubMed · 3981632
Improving sequence-matching algorithms by working from both ends.
Abstract
Recent algorithms (e.g. Ukkonen, Fickett) align nucleic acid sequences (starting from the left) by bounding the allowed distance between subsequences by d, aligning, then incrementing d until all of both sequences are aligned. Aligning from both ends is more efficient. If the single-ended algorithm has computational cost CNk (C, k = constants; N = sequence length), the double-ended algorithm often has cost C(N/2)k.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J L Spouge. 1985-01-05. Improving sequence-matching algorithms by working from both ends.. https://doi.org/10.1016/0022-2836(85)90331-6
Cite the original work for its findings. Save a collection to share your selection of sources.