10602 search results - page 302 / 2121 » Weakly Useful Sequences |
156
click to vote
SPIRE
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
175
click to vote
GCB
1997
Springer
15 years 11 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
189
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
181
click to vote
RIVF
2008
15 years 8 months ago
2008
Abstract--Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of thi...
159
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Message Sequence Charts (MSCs) is a notation used in practice by protocol designers and system engineers. It is defined within an international standard (ITU Z120), and is also i...