10602 search results - page 2037 / 2121 » Weakly Useful Sequences |
123
click to vote
TCBB
2008
15 years 4 months ago
2008
Emerging microarray technologies allow affordable typing of very long genome sequences. A key challenge in analyzing of such huge amount of data is scalable and accurate computatio...
105
click to vote
ARSCOM
2005
15 years 4 months ago
2005
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
134
click to vote
TCOM
2008
15 years 4 months ago
2008
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
132
Voted
TCS
2008
15 years 4 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
135
click to vote
BIOINFORMATICS
2005
15 years 4 months ago
2005
BioLingua is an interactive, web-based programming environment that enables biologists to analyze biological systems by combining knowledge and data through direct end-user progra...