Cargando…
Dynamic partitioning of search patterns for approximate pattern matching using search schemes
Search schemes constitute a flexible and generic framework to describe how all approximate occurrences of a search pattern in a text can be found efficiently. We propose an algorithm for the dynamic partitioning of search patterns which can be universally applied to any kind of search scheme and dem...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8246400/ https://www.ncbi.nlm.nih.gov/pubmed/34235407 http://dx.doi.org/10.1016/j.isci.2021.102687 |