Sciweavers

254 search results - page 30 / 51
» Finding Transport Proteins in a General Protein Database
Sort
View
CCCG
2006
13 years 9 months ago
On the Maximum Span of Fixed-Angle Chains
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
Nadia Benbernou, Joseph O'Rourke
BMCBI
2010
147views more  BMCBI 2010»
13 years 7 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
CIKM
2008
Springer
13 years 9 months ago
A system for finding biological entities that satisfy certain conditions from texts
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...
Wei Zhou, Clement T. Yu, Weiyi Meng
BMCBI
2007
156views more  BMCBI 2007»
13 years 7 months ago
Accuracy of structure-based sequence alignment of automatic methods
Background: Accurate sequence alignments are essential for homology searches and for building three-dimensional structural models of proteins. Since structure is better conserved ...
Changhoon Kim, Byungkook Lee