10435 search results - page 322 / 2087 » Computational Biology and Language |
173
click to vote
ASM
2004
ASM
16 years 4 days ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
183
click to vote
ICS
2004
Tsinghua U.
16 years 3 days ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
155
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Clusters of genes that evolved from single progenitors via repeated segmental duplications present significant challenges to the generation of a truly complete human geno...
161
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
195
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...