Sciweavers

    11 search results - page 1 / 3
    » Maximum common subgraph isomorphism algorithms for the match...
    Sort
    View
    JCAMD
    2002
    38views more  JCAMD 2002»
    Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    13 years 7 months ago
    Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    Download  www.comp.nus.edu.sg
    John W. Raymond, Peter Willett 0002
    claim paper
    Read More »
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    13 years 7 months ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    claim paper
    Read More »
    ICDE
    2006
    IEEE
    196views Database» more  ICDE 2006»
    Closure-Tree: An Index Structure for Graph Queries
    14 years 8 months ago
    Closure-Tree: An Index Structure for Graph Queries
    Download  www.cs.ucsb.edu
    Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
    Huahai He, Ambuj K. Singh
    claim paper
    Read More »
    BMCBI
    2006
    141views more  BMCBI 2006»
    Maximum common subgraph: some upper bound and lower bound results
    13 years 7 months ago
    Maximum common subgraph: some upper bound and lower bound results
    Download  www.biomedcentral.com
    Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
    Xiuzhen Huang, Jing Lai, Steven F. Jennings
    claim paper
    Read More »
    ISDA
    2009
    IEEE
    115views Operating System» more  ISDA 2009»
    Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
    14 years 2 months ago
    Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
    Download  www.mathematik.uni-marburg.de
    —Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
    Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.