5404 search results - page 250 / 1081 » Global Computing for Bioinformatics |
154
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
183
click to vote
DNA
2004
Springer
16 years 15 days ago
2004
Springer
The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is pr...
183
click to vote
WABI
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
189
Voted
AI
2005
Springer
16 years 19 days ago
2005
Springer
This paper deals with the incremental off-line computation of diagnosis of discrete-event systems. Traditionally, the diagnosis is computed from the global automaton describing th...
156
Voted
ICPP
1996
IEEE
15 years 11 months ago
1996
IEEE
Abstract