Approximate string-matching with a single gap for sequence alignment
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00188296" target="_blank" >RIV/68407700:21240/11:00188296 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximate string-matching with a single gap for sequence alignment
Original language description
This paper deals with the approximate string-matching problem with Hamming distance and a single gap for sequence alignment. We consider an extension of the approximate string-matching problem with Hamming distance, by also allowing the existence of a single gap, either in the text, or in the pattern. This problem is strongly and directly motivated by the next-generation re-sequencing procedure. We present a general algorithm that requires O(nm) time, where n is the length of the text and m is the length of the pattern, but this can be reduced to O(m?) time, if the maximum length ? of the gap is given.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ACM BCB 2011: ACM Conference on Bioinformatics, Computational Biology and Biomedicine
ISBN
978-1-4503-0796-3
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
490-492
Publisher name
ACM
Place of publication
New York
Event location
Chicago
Event date
Aug 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—