| 000 -LEADER |
|---|
| fixed length control field |
03406nam a2200301Ia 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
76934 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
ft6136 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251107094600.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
190311n 000 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Description conventions |
rda |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
engtag |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9 M34 2013 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
. |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Regine B. Magbiray and Antonio S. Ronda Jr. |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
An enhancement of the smith -waterman algorithm applied in query by humming for music information retrieval |
| 264 ## - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
. |
| Name of producer, publisher, distributor, manufacturer |
. |
| Date of production, publication, distribution, manufacture, or copyright notice |
c2013 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Other physical details |
Undergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2013. |
| 336 ## - CONTENT TYPE |
|---|
| Content type code |
. |
| Content type term |
text |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Materials specified |
0 |
| Media type code |
. |
| Media type term |
unmediated |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Materials specified |
0 |
| Carrier type code |
. |
| Carrier type term |
volume |
| Source |
rdacarrier |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
ABSTRACT: The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadratic time and space complexity. It also neglects some data in its computation and cannot handle large deletion in a given pattern for comparison. As a result, many algorithmic and architectural enhancements have been proposed to solve this problem, but at the cost of reduced sensitivity in the algorithms or significant expense in hardware, respectively. Hence, there exists a need to enhancement. The researchers applied divide and conquer strategy to solve its computational time drawback. In handling large deletion problem, incremental gap alignment was used to solve missed hits of match and consider the large gap brought by the deletion. Finally, the researchers compared the enhanced algorithm with the original Smith-Waterman. As for the result, the enhanced algorithm performs faster by up to 75 percent making its complexity to O (mn/t). In handling large deletion and missed data in the matrix, the enhanced algorithm improved its way in handling the subsequence and collects all information for the results to be outputted to handle large deletion and missed data in the matrix. |
| 506 ## - RESTRICTIONS ON ACCESS NOTE |
|---|
| Terms governing access |
5 |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
ABSTRACT: The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadratic time and space complexity. It also neglects some data in its computation and cannot handle large deletion in a given pattern for comparison. As a result, many algorithmic and architectural enhancements have been proposed to solve this problem, but at the cost of reduced sensitivity in the algorithms or significant expense in hardware, respectively. Hence, there exists a need to enhancement. The researchers applied divide and conquer strategy to solve its computational time drawback. In handling large deletion problem, incremental gap alignment was used to solve missed hits of match and consider the large gap brought by the deletion. Finally, the researchers compared the enhanced algorithm with the original Smith-Waterman. As for the result, the enhanced algorithm performs faster by up to 75 percent making its complexity to O (mn/t). In handling large deletion and missed data in the matrix, the enhanced algorithm improved its way in handling the subsequence and collects all information for the results to be outputted to handle large deletion and missed data in the matrix. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
|---|
| Classification |
Filipiniana |
| 540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE |
|---|
| Terms governing use and reproduction |
5 |
| 655 ## - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
. |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Institution code [OBSOLETE] |
lcc |
| Item type |
Thesis/Dissertation |
| Source of classification or shelving scheme |
|