Algoritmos de búsqueda de patrones de texto
The purpose of this study was to determine the efficiency of the algorithms for searching text patterns: Brute Force, Boyer-Moore-Horspool, Knuth-Morris-Pratt and MapReduce, in order to establish which one or which showed the best behavior. To comply with its development it was necessary to use the...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | bachelorThesis |
| Langue: | spa |
| Publié: |
2017
|
| Sujets: | |
| Accès en ligne: | http://repositorio.espam.edu.ec/handle/42000/668 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Ajouter un tag | Résumé: | The purpose of this study was to determine the efficiency of the algorithms for searching text patterns: Brute Force, Boyer-Moore-Horspool, Knuth-Morris-Pratt and MapReduce, in order to establish which one or which showed the best behavior. To comply with its development it was necessary to use the methods: bibliographic, analytical and experimental design with analysis of variance with several factors. Through the bibliographic method it was possible to define algorithms to search for text patterns. Afterwards, the analysis of the algorithms was performed with the analytical method, where the following indicators were used: number of hits, resources to store and process (RAM) and the response time, then the algorithms were compiled on six different computers with the IDE (Integrated Development Environment): C-Free, Dev-C ++ and CodeBlocks. Finally, the efficiency and effectiveness of the algorithms were established through experimental design with analysis of variance with several factors. The procedure described above allowed us to establish that in the indicators: on number of hits and response time the Brute Force algorithm is more efficient, while IDE CodeBlocks presented better behavior with respect to the algorithms. |
|---|