Pattern-matching with bounded gaps in genomic sequences

Autor:	Yoan José Pinzon Ardila, Shu Wang
Jazyk:	English<br />Spanish; Castilian
Rok vydání:	2009
Předmět:	string pattern matching gaps genomic sequences Computer engineering. Computer hardware TK7885-7895 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Revista Colombiana de Computación, Vol 10, Iss 1 (2009)
Druh dokumentu:	article
ISSN:	1657-2831 2539-2115
Popis:	Recently, some pattern matching algorithms allowing gaps were introduced in Crochemore et al. [Approximate string matching with gaps. Nordic Journal of Computing, 9 (2002):54–65, 2002], where upper-bounded, strict-bounded and unbounded gaps were considered. In this paper we further extend these restrictions on the gaps to permit lower-bounded and (lower-upper)-bounded gaps that we simply refer to as (a,b)-bounded gaps. We give formal definitions for these problems as well as their respective algorithmic solutions.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/3c4ab6129b1141a38e9091b3901f5855 Zobrazit plný text záznamu View record in DOAJ