Special Feature

User Panel

My Panel

My Panel

Bookmark Science Articles

Recent News
Bookmark / Share This Science Site

Maximum common subgraph: some upper bound and lower bound results.

Maximum common subgraph: some upper bound and lower bound results. Research Abstract Details 

Research Abstract Table of Contents

Jump to the:

  • Abstract Text of This Paper
  • Journal Published
  • MeSH Keywords of This Abstract
  • Chemicals and Substances Used in this Paper
  • Grants and Granting Agency of this Research
  • Database Accession Numbers Used in this Paper
  • Related Papers
  • Related Research Tags
  • Rate this Research Paper
  • Maximum common subgraph: some upper bound and lower bound results. Abstract Text:

    xiuzhen huangXiuzhen Huang,jing laiJing Lai,steven f jenningsSteven F Jennings,

    BACKGROUND: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical representations of these structures. Among the many different variants of the maximum common subgraph problem, the maximum common induced subgraph of two graphs is of special interest. RESULTS: Based on current research in the area of parameterized computation, we derive a new lower bound for the exact algorithms of the maximum common induced subgraph of two graphs which is the best currently known. Then we investigate the upper bound and design techniques for approaching this problem, specifically, reducing it to one of finding a maximum clique in the product graph of the two given graphs. Considering the upper bound result, the derived lower bound result is asymptotically tight. CONCLUSION: Parameterized computation is a viable approach with great potential for investigating many applications within bioinformatics, such as the maximum common subgraph problem studied in this paper. With an improved hardness result and the proposed approaches in this paper, future research can be focused on further exploration of efficient approaches for different variants of this problem within the constraints imposed by real applications.

    Maximum common subgraph: some upper bound and lower bound results. Publishing Authors By Initials

    x huangX Huang,j laiJ Lai,sf jenningsSF Jennings,

    For similar investigative techniques: genetic techniques: sequence analysis research abstracts see: investigative techniques: genetic techniques: sequence analysis research

    PUBMED ID PMID:

    MEDLINE DATE:

    Maximum common subgraph: some upper bound and lower bound results. Journal Published:

    PUBLICATION TYPE: Research Support, N.I.H., Extr

    Journal: BMC bioinformatics

    VOLUME: 7 Suppl 4

    Page Numbers: S6

    Journal Abbreviation: BMC Bioinformatics

    ISSN: 1471-2105

    DAY: 12

    MONTH: 12

    YEAR: 2006

    Maximum common subgraph: some upper bound and lower bound results. Information

    Number of References:

    LANGUAGE: eng

    NlmUniqueID: 100965194

    Maximum common subgraph: some upper bound and lower bound results. Keywords Mesh Terms:

    KEYWORDS: Sequence Analysis

    MESH TERMS: methods

    Chemical & Substance for Abstract: Maximum common subgraph: some upper bound and lower bound results. Information

    Substance Name: Biopolymers

    Registry Number: 0

    Grant and Affiliation Information for Maximum common subgraph: some upper bound and lower bound results.

    AFFILIATION: Department of Computer Science, Arkansas State University, State University, Arkansas 72467, USA. xzhuang@csm.astate.edu

    Country: England

    England Research PublicationEngland Research Publication

    AGENCY: United States NCRR

    GRANT: P20 RR-16460

    ACRONYM: RR

    MEDLINETA: BMC Bioinformatics

    REFSOURCE:

    DATABASENAME:

    ACCESSION NUMBER:

    Number Hits: 0

    Maximum common subgraph: some upper bound and lower bound results Related Publications

     

    Molecular Station USER Menu

    Welcome to Molecular Station!

    You have to register before you can post on our forums or use our advanced features. Register Now! Its Free and Fast!

    Already registered? Login now below.

    User Name:

    Password:

    Already registered and Forgot your password? Click below to recover it.

    Recover Lost Password

    Join now - it's fast and free!

    Molecular Station is THE largest network of researchers, scientists and science lovers anywhere!

    Research Terms of Usage and Disclaimer
    Home
    Features

    Protocols

    DNA Forum

    Science Forum

    DNA Forum
    Biology Forum

    Science News


    [CaRP] XML error: Invalid document end at line 2

    For more click here:Science News