Sciweavers

375 search results - page 53 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
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 ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
COR
2008
97views more  COR 2008»
13 years 7 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
High quality protein sequence alignment by combining structural profile prediction and profile alignment using SABERTOOTH
Background: Protein alignments are an essential tool for many bioinformatics analyses. While sequence alignments are accurate for proteins of high sequence similarity, they become...
Florian Teichert, Jonas Minning, Ugo Bastolla, Mar...