2994 search results - page 106 / 599 » Time sequences |
99
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
132
click to vote
BIBE
2008
IEEE
15 years 7 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
111
Voted
BMCBI
2007
15 years 26 days ago
2007
Background: Biological sequence repeats arranged in tandem patterns are widespread in DNA and proteins. While many software tools have been designed to detect DNA tandem repeats (...
82
Voted
HICSS
2000
IEEE
15 years 5 months ago
2000
IEEE
Clinical pathways are widely adopted by many large hospitals around the world in order to provide high-quality patient treatment and reduce the length of hospital stay of each pat...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...