Normal view MARC view ISBD view

An enhancement of tuned Boyer-Moore algorithm for searching and editing strings on text editor / Barredo, John Fitzgerald P. and Tagle, Nino Kelvin P. 6

By: Barredo, John Fitzgerald P. and Tagle, Nino Kelvin P. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2013.46Edition: Description: 28 cm. 83 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: Enhancing a string matching algorithm has attracted a lot of interest throughout the history of computer science, and is considered as crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms. One of the important aspects in enhancing a string matching algorithm is considering its speed and how effective it is in a certain field. The Tuned-Boyer Moore algorithm itself is said to be an effective algorithm, it has a fair time complexity, and is efficient in searching substrings within substrings, Due to the analysis of a text editor, it has been observed that its searching function doesn't need to locate substrings within substrings since words are the common elements inside a text editor. It is best to suit the algorithm for the needs of the application, which means its process will be as to satisfy only the condition of the application. In this study, the Tuned-Boyer Moore was put into a test, and implemented inside a text editor. In the same token, we have created our own string matching algorithm based Tuned-Boyer Moore and was implemented into a text editor as well. Both are tested, and are compared in terms of time and accuracy. In the course of this work and experimentations it has been proven that the algorithm is much faster than the existing. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Archives	Filipiniana-Thesis	264 (Browse shelf)	Available		FT6125

Total holds: 0

Browsing PLM Shelves , Shelving location: Archives , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	247 Water sensor /	248 Image authentication: A process of embedding seals to Targa monochrome or palette images /	263 An enhancement of math equation parsing using call stacks /	264 An enhancement of tuned Boyer-Moore algorithm for searching and editing strings on text editor /	265 A Further enhancement of Boyer-Moore Horspool algorithm for dictionary to be applied in MS Word 2007 /	266 A further enhancement of n-gram algorithm for accurate and precise word prediction /	267 Further enhancement of LZW++ algorithm applied to text compression and decompression	Next

Undergraduate Thesis: (Bachelor of Science in Computer Studies major in Computer Science) Pamantasan ng Lungsod ng Maynila, 2013. 56

ABSTRACT: Enhancing a string matching algorithm has attracted a lot of interest throughout the history of computer science, and is considered as crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms. One of the important aspects in enhancing a string matching algorithm is considering its speed and how effective it is in a certain field. The Tuned-Boyer Moore algorithm itself is said to be an effective algorithm, it has a fair time complexity, and is efficient in searching substrings within substrings, Due to the analysis of a text editor, it has been observed that its searching function doesn't need to locate substrings within substrings since words are the common elements inside a text editor. It is best to suit the algorithm for the needs of the application, which means its process will be as to satisfy only the condition of the application. In this study, the Tuned-Boyer Moore was put into a test, and implemented inside a text editor. In the same token, we have created our own string matching algorithm based Tuned-Boyer Moore and was implemented into a text editor as well. Both are tested, and are compared in terms of time and accuracy. In the course of this work and experimentations it has been proven that the algorithm is much faster than the existing.

There are no comments for this item.

to post a comment.