Log in to save to my catalogue

SeArcH schemes for Approximate stRing mAtching

SeArcH schemes for Approximate stRing mAtching

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_11915513

SeArcH schemes for Approximate stRing mAtching

About this item

Full title

SeArcH schemes for Approximate stRing mAtching

Publisher

England: Oxford University Press

Journal title

NAR genomics and bioinformatics, 2025-03, Vol.7 (1), p.lqaf025

Language

English

Formats

Publication information

Publisher

England: Oxford University Press

More information

Scope and Contents

Contents

Finding approximate occurrences of a query in a text using a full-text index is a central problem in stringology with many applications, especially in bioinformatics. The recent work has shown significant speed-ups by combining bidirectional indices and employing variations of
. Search schemes partition a query and describe how to search the res...

Alternative Titles

Full title

SeArcH schemes for Approximate stRing mAtching

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_11915513

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_11915513

Other Identifiers

ISSN

2631-9268

E-ISSN

2631-9268

DOI

10.1093/nargab/lqaf025

How to access this item