Abstract
Abstract Database sequence comparison applications compare a query sequence with each sequence in a database to find the closest match. These applications are high consumers of computation time because they use dynamic programming algorithms to perform the large number of required sequence comparisons. Traditional methods perform the comparisons on the entire set of sequences in the database. In this work, we introduce a novel high-speed technique that reduces the number of database sequences to which the time-consuming matching algorithm is applied. The selection of the target database sequences is based on similarity measures that will be introduced in this contribution as well. Using the proposed technique and the proposed similarity measures, we are able to accelerate the database sequence comparison by 65% compared to traditional exhaustive methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
