Sciweavers

191 search results - page 13 / 39
» On the rigidity of molecular graphs
Sort
View
IAJIT
2006
109views more  IAJIT 2006»
13 years 7 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
JCB
2007
168views more  JCB 2007»
13 years 7 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
DIS
2004
Springer
14 years 1 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
GD
2003
Springer
14 years 25 days ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
BMCBI
2007
162views more  BMCBI 2007»
13 years 7 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee