2654 search results - page 373 / 531 » On Pairing Inversion Problems |
131
Voted
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
122
Voted
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
152
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
118
Voted
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
143
Voted
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...