Edit Sequence, constant-size alphabet (Sequence Alignment)
Revision as of 10:20, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Edit Sequence, constant-size alphabet (Sequence Alignment)}} == Description == Given two strings, determine the shortest sequence of edits required to transform one of the strings into the other. Assume we have a constant-size alphabet. == Related Problems == Generalizations: Edit Distance, constant-size alphabet == Parameters == <pre>n, m: lengths of input strings; assume n≥m</pre> == Table of Algorithms == {| class="wikitable sortable"...")
Description
Given two strings, determine the shortest sequence of edits required to transform one of the strings into the other. Assume we have a constant-size alphabet.
Related Problems
Generalizations: Edit Distance, constant-size alphabet
Parameters
n, m: lengths of input strings; assume n≥m
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Gapped BLAST | 1997 | $O(mn)$ | $O(mn)$? | Exact | Deterministic | Time |
| Basic Local Alignment Search Tool (BLAST) | 1990 | $O(mn)$ | $O(mn)$? | Exact | Deterministic | Time |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
References/Citation
https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub