255 search results - page 13 / 51 » Approximate matching of secondary structures |
JCB
2007
13 years 9 months ago
2007
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...
EDBT
2006
ACM
14 years 22 days ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
AAAI
2007
13 years 11 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
FQAS
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...