10435 search results - page 212 / 2087 » Computational Biology and Language |
158
click to vote
RECOMB
2002
Springer
16 years 6 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
148
click to vote
ASM
2000
ASM
15 years 11 months ago
2000
ASM
Abstract. We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoni...
180
click to vote
ASM
1998
ASM
15 years 10 months ago
1998
ASM
This paper is devoted to the speci cation of the Stanford FLASHcache coherence protocol within the ASM formalism. Correctness proofs related to data consistency are presented. Corn...
146
click to vote
RECOMB
1998
Springer
15 years 10 months ago
1998
Springer
This paper studies various properties of the least common ancestors mapping, the duplication and mutation costs, and the complexity of nding a species tree from gene trees.