Revision as of 13:37, 19 April 2018 edit John Douglas Huff (talk \| contribs) 32 edits No edit summary ← Previous edit		Revision as of 13:45, 19 April 2018 edit undo John Douglas Huff (talk \| contribs) 32 edits No edit summary Next edit →
Line 1: The '''Ruzzo-Tompa algorithm''' is a linear time algorithm for finding all non-overlapping, contiguous, maximal scoring subsequences in a sequence of real numbers.<ref>{{cite journal\|last1=Ruzzo\|first1=Walter L.\|last2=Martin\|first2=Tompa\|title=A Linear Time Algorithm for Finding All Maximal Scoring Subsequences\|journal=Proceedings. International Conference on Intelligent Systems for Molecular Biology\|date=1999\|pages=234-241\|pmid=10786306\|url=https://dl.acm.org/citation.cfm?id=660812\|ref=ruzzo-tompa}}</ref>. This algorithm is an improvement over previously known quadratic time algorithms. The maximum scoring subsequence from the set produced by the algorithm is also a solution to the [[Maximum subarray problem]]. The Ruzzo-Tompa algorithm has applications in [[Bioinformatics]], [[Web ~~Scraping~~scraping]], and [[Information retrieval]]. ==Applications==

Ruzzo–Tompa algorithm: Difference between revisions