Sciweavers

    324 search results - page 1 / 65
    » Detecting common elements of types
    Sort
    View
    SFP
    2000
    106views Programming Languages» more  SFP 2000»
    Detecting common elements of types
    13 years 6 months ago
    Detecting common elements of types
    Download  www.fernuni-hagen.de
    : We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
    Manfred Widera, Christoph Beierle
    claim paper
    Read More »
    BMCBI
    2007
    117views more  BMCBI 2007»
    Meta-analysis of several gene lists for distinct types of cancer: A simple way to reveal common prognostic markers
    13 years 5 months ago
    Meta-analysis of several gene lists for distinct types of cancer: A simple way to reveal common prognostic markers
    Download  www.biomedcentral.com
    Background: Although prognostic biomarkers specific for particular cancers have been discovered, microarray analysis of gene expression profiles, supported by integrative analysis...
    Xinan Yang, Xiao Sun
    claim paper
    Read More »
    SIAMCOMP
    2008
    95views more  SIAMCOMP 2008»
    On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
    13 years 5 months ago
    On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
    Download  pluto.huji.ac.il
    Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
    Nir Halman
    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
    13 years 12 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 »
    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 5 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 »
    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.