Sciweavers

872 search results - page 89 / 175
» Score Processing For MIR
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 9 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 8 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
109
Voted
HCI
2007
15 years 4 months ago
Cooperation and Competition Dynamics in an Online Game Community
Cooperation and competition are important subjects in social and economical studies. Similar dynamics exists in large-scale online communities. In this paper, we present a quantita...
Ruixi Yuan, Li Zhao, Wenyu Wang
BMCBI
2010
132views more  BMCBI 2010»
15 years 3 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
BMCBI
2008
110views more  BMCBI 2008»
15 years 3 months ago
Predikin and PredikinDB: a computational framework for the prediction of protein kinase peptide specificity and an associated da
Background: We have previously described an approach to predicting the substrate specificity of serine-threonine protein kinases. The method, named Predikin, identifies key conser...
Neil F. W. Saunders, Ross I. Brinkworth, Thomas Hu...