<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05946457</id>
  <dt>a</dt>
  <an>05946457</an>
  <augroup>
    <au>Malod-Dognin, Noel</au>
    <au>Le Boudic-Jamin, Mathilde</au>
    <au>Kamath, Pritish</au>
    <au>Andonov, Rumen</au>
  </augroup>
  <ti>Using dominances for solving the protein family identification problem.</ti>
  <so>Przytycka, Teresa M. (ed.) et al., Algorithms in bioinformatics. 11th international workshop, WABI 2011, Saarbr\"ucken, Germany, September 5--7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23037-0/pbk). Lecture Notes in Computer Science 6833. Lecture Notes in Bioinformatics, 201-212 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>protein structure comparison</ut>
    <ut>classification</ut>
    <ut>bounds</ut>
    <ut>dominance</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-23038-7_18</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>