Mostrar el registro sencillo del ítem

Pattern-matching with bounded gaps in genomic sequences

dc.creatorPinzon Ardila, Yoan José
dc.creatorWang, Shu
dc.date2009-06-01
dc.date.accessioned2022-03-03T19:57:39Z
dc.date.available2022-03-03T19:57:39Z
dc.identifierhttps://revistas.unab.edu.co/index.php/rcc/article/view/1139
dc.identifier.urihttp://test.repositoriodigital.com:8080/handle/123456789/13910
dc.descriptionRecently, 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Autónoma de Bucaramangaes-ES
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1139/1129
dc.rightsDerechos de autor 2009 Revista Colombiana de Computaciónes-ES
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/4.0es-ES
dc.sourceRevista Colombiana de Computación; Vol. 10 No. 1 (2009): Revista Colombiana de Computación (Enero-Junio); 110-119en-US
dc.sourceRevista Colombiana de Computación; Vol. 10 Núm. 1 (2009): Revista Colombiana de Computación (Enero-Junio); 110-119es-ES
dc.source2539-2115
dc.source1657-2831
dc.subjectstring pattern matchinges-ES
dc.subjectgapses-ES
dc.subjectgenomic sequenceses-ES
dc.titlePattern-matching with bounded gaps in genomic sequenceses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem