Cargando…
Entropy-Based Approach in Selection Exact String-Matching Algorithms
The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with...
Autores principales: | Markić, Ivan, Štula, Maja, Zorić, Marija, Stipaničev, Darko |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7824336/ https://www.ncbi.nlm.nih.gov/pubmed/33379282 http://dx.doi.org/10.3390/e23010031 |
Ejemplares similares
-
Fast algorithms for approximate circular string matching
por: Barton, Carl, et al.
Publicado: (2014) -
On field redefinitions and exact solutions in string theory
por: Tseytlin, Arkady A.
Publicado: (1993) -
Exact string-theory instantons by dimensional reduction
por: Bachas, C., et al.
Publicado: (1994) -
On (multi-)center branes and exact string vacua
por: Sfetsos, Konstadinos
Publicado: (1998) -
Exact duality symmetries in CFT and string theory
por: Kiritsis, Elias
Publicado: (1993)