Sciweavers

8431 search results - page 57 / 1687
» Algorithmically Independent Sequences
Sort
View
ICCL
1998
IEEE
15 years 2 months ago
Location-Independent Communication for Mobile Agents: A Two-Level Architecture
We study communication primitives for interaction between mobile agents. They can be classified into two groups. At a low level there are location dependent primitives that require...
Peter Sewell, Pawel T. Wojciechowski, Benjamin C. ...
KELSI
2004
Springer
15 years 3 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
PKDD
2005
Springer
105views Data Mining» more  PKDD 2005»
15 years 3 months ago
Protein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
Pedro Gabriel Ferreira, Paulo J. Azevedo
TOPNOC
2010
14 years 4 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
ISMB
1993
14 years 11 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic