Lossless Approximate Pattern Matching: Automated Design of Efficient Search Schemes

This study introduces a pioneering approach to automate the creation of search schemes for lossless approximate pattern matching. Search schemes are combinatorial structures that define a series of searches over a partitioned pattern. Each search specifies the processing order of these parts and the...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computational biology Ročník 31; číslo 10; s. 975
Hlavní autori:	Renders, Luca, Depuydt, Lore, Rahmann, Sven, Fostier, Jan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States 01.10.2024
Predmet:	Algorithms Computational Biology - methods Humans Pattern Recognition, Automated - methods Programming, Linear Software approximate pattern matching integer linear program sequence alignment search schemes
ISSN:	1557-8666, 1557-8666
On-line prístup:	Zistit podrobnosti o prístupe
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!