Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis (Q5881357)
From MaRDI portal
scientific article; zbMATH DE number 7661710
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis |
scientific article; zbMATH DE number 7661710 |
Statements
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis (English)
0 references
9 March 2023
0 references
algorithmic framework
0 references
approximate sequence matching
0 references
longest common substring problem
0 references
average common substring (ACS)
0 references
heavy path
0 references
