Using dominances for solving the protein family identification problem

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Malod-Dognin, N., Le Boudic-Jamin, M., Kamath, P., & Andonov, R. (2011). Using dominances for solving the protein family identification problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6833 LNBI, pp. 201–212). https://doi.org/10.1007/978-3-642-23038-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free