3958 search results - page 70 / 792 » Dynamic Graph Algorithms with Applications |
165
click to vote
ALMOB
2006
15 years 4 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
162
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
151
click to vote
CCGRID
2010
IEEE
15 years 2 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
129
click to vote
BIRD
2008
Springer
15 years 6 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
137
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...