Optimal neighborhood indexing for protein similarity search

Pierre Peterlongo 1, * Laurent Noé 2, 3 Dominique Lavenier 1 Van Hoa Nguyen 1 Gregory Kucherov 2, 3 Mathieu Giraud 2
* Auteur correspondant
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
3 SEQUOIA - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated \evalue parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.
Liste complète des métadonnées

Contributeur : Pierre Peterlongo <>
Soumis le : vendredi 21 novembre 2008 - 09:39:44
Dernière modification le : mercredi 11 avril 2018 - 01:55:31
Document(s) archivé(s) le : jeudi 11 octobre 2012 - 11:50:47


Fichiers produits par l'(les) auteur(s)



Pierre Peterlongo, Laurent Noé, Dominique Lavenier, Van Hoa Nguyen, Gregory Kucherov, et al.. Optimal neighborhood indexing for protein similarity search. BMC Bioinformatics, BioMed Central, 2008, 9 (534), 〈10.1186/1471-2105-9-534〉. 〈inria-00340510〉



Consultations de la notice


Téléchargements de fichiers