Cargando…
Improved algorithms for approximate string matching (extended abstract)
BACKGROUND: The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two stri...
Autores principales: | Papamichail, Dimitris, Papamichail, Georgios |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648743/ https://www.ncbi.nlm.nih.gov/pubmed/19208109 http://dx.doi.org/10.1186/1471-2105-10-S1-S10 |
Ejemplares similares
-
Fast algorithms for approximate circular string matching
por: Barton, Carl, et al.
Publicado: (2014) -
Computational Tools and Algorithms for Designing Customized Synthetic Genes
por: Gould, Nathan, et al.
Publicado: (2014) -
Complexity Issues of String to Graph Approximate Matching
por: Dondi, Riccardo, et al.
Publicado: (2020) -
Outer membrane protein genes and their small non-coding RNA regulator genes in Photorhabdus luminescens
por: Papamichail, Dimitris, et al.
Publicado: (2006) -
Fast randomized approximate string matching with succinct hash data structures
por: Policriti, Alberto, et al.
Publicado: (2015)