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...

Full description

Bibliographic Details

Published in:	Journal of computational biology Vol. 31; no. 10; p. 975
Main Authors:	Renders, Luca, Depuydt, Lore, Rahmann, Sven, Fostier, Jan
Format:	Journal Article
Language:	English
Published:	United States 01.10.2024
Subjects:	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
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!