loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Cody Ashby 1 ; Kun Wang 2 ; Carole L. Cramer 1 and Xiuzhen Huang 1

Affiliations: 1 Arkansas State University, United States ; 2 University of Arkansas at Little Rock, United States

ISBN: 978-989-8425-90-4

Keyword(s): Protein structure-structure alignment, Color coding, Parameterized computation, Maximum common subgraph.

Related Ontology Subjects/Areas/Topics: Algorithms and Software Tools ; Bioinformatics ; Biomedical Engineering ; Model Design and Evaluation ; Structural Bioinformatics

Abstract: Motivated by the practical application of protein structure-structure alignment, we have studied the problem of maximum common subgraph within the framework of parameterized complexity. We investigated the lower bound for the exact algorithms of the problem. We proved it is unlikely that there is an algorithm of time p(n,m) ∗ ko(m) for the problem, where p is a polynomial function, k is a parameter of map width, and m and n are the numbers of vertices of the two graphs respectively. In consideration of the upper bound of p(n,m)∗km based on the brute-force approach, our lower bound result is asymptotically tight. Although the algorithm with the running time p(n,m) ∗ km could not be significantly improved from our lower bound result, it is still possible to develop efficient algorithms for the practical application of the protein structure-structure alignment. We developed an efficient algorithm integrating the color coding method and parameterized computation for identifying the maximu m common subgraph of two protein structure graphs. We have applied the algorithm to protein structure-structure alignment and conducted experimental testing of more than 600 protein pairs. Our parameterized approach shows improvement in structure alignment efficiency and will be very useful for structure comparisons of proteins with large sizes. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.208.187.169

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Ashby, C.; Wang, K.; L. Cramer, C. and Huang, X. (2012). STUDY OF PROTEIN STRUCTURE ALIGNMENT PROBLEM IN PARAMETERIZED COMPUTATION.In Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012) ISBN 978-989-8425-90-4, pages 174-181. DOI: 10.5220/0003769701740181

@conference{bioinformatics12,
author={Cody Ashby. and Kun Wang. and Carole L. Cramer. and Xiuzhen Huang.},
title={STUDY OF PROTEIN STRUCTURE ALIGNMENT PROBLEM IN PARAMETERIZED COMPUTATION},
booktitle={Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012)},
year={2012},
pages={174-181},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003769701740181},
isbn={978-989-8425-90-4},
}

TY - CONF

JO - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2012)
TI - STUDY OF PROTEIN STRUCTURE ALIGNMENT PROBLEM IN PARAMETERIZED COMPUTATION
SN - 978-989-8425-90-4
AU - Ashby, C.
AU - Wang, K.
AU - L. Cramer, C.
AU - Huang, X.
PY - 2012
SP - 174
EP - 181
DO - 10.5220/0003769701740181

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.