MSS 1.0
:: DESCRIPTION
MSS (Maximal Scoring Subsequences) is a practical, linear time algorithm to find, in a sequence of numeric scores, those nonoverlapping, contiguous subsequences having greatest total scores.
Advertisement
::DEVELOPER
The Computational & Synthetic Biology group – COMPUTER SCIENCE & ENGINEERING at UNIVERSITY OF WASHINGTON
:: SCREENSHOTS
Command Line
:: REQUIREMENTS
:: DOWNLOAD
:: MORE INFORMATION
Citation:
W. Ruzzo, M. Tompa, “A linear time algorithm for finding all maximal scoring subsequences”, Proc Int Conf Intell Syst Mol Biol, (1999) 234-41. Pubmed 10786306.