8481 articles  [version française]

inria-00609432, version 1

Using Dominances for Solving the Protein Family Identification Problem

Noël Malod-Dognin () 1, Mathilde Le Boudic-Jamin () b2, Pritish Kamath () a3, Rumen Andonov (Author to contact preferably) b2

11th Workshop on Algorithms in Bioinformatics (WABI 2011) 6833 (2011) 201-212

Abstract: Identification of protein families is a computational biology challenge that needs efficient and reliable methods. Here we introduce the concept of dominance and propose a novel combined approach based on Distance Alignment Search Tool (DAST), which contains an exact algorithm with bounds. Our experiments show that this method successfully finds the most similar proteins in a set without solving all instances.

  • a –  II T Bombay
  • b –  Université de Rennes I
  • 1:  ABS (INRIA Sophia Antipolis)
  • INRIA
  • 2:  SYMBIOSE (INRIA - IRISA)
  • CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Université de Rennes 1
  • 3:  Indian Institute of Technology [Bombay] (IIT Bombay)
  • II T Bombay
  • Domain : Computer Science/Bioinformatics
    Life Sciences/Quantitative Methods
  • Keywords : Protein structure comparison – classification – bounds – dominance
  • Internal note : RR-7688
  • Comment : Published in Workshop on Algorithms for Bioinformatics (WABI 2011)
 
  • inria-00609432, version 1
  • oai:hal.inria.fr:inria-00609432
  • From: 
  • Submitted on: Tuesday, 19 July 2011 09:36:39
  • Updated on: Friday, 18 November 2011 16:41:03