Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fondrat, C.
Right arrow Articles by Dessen, P.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Fondrat, C.
Right arrow Articles by Dessen, P.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A rapid access motif database (RAMdb) with a search algorithm for the retrieval patterns in nucleic acids or protein databanks

Christian Fondrat and Phillippe Dessen 1

CITI2 (Centre Interuniversitaire de Traitement de I'Information), Universite Paris 5, 45 rue des Saints-Pères, F-75006 Paris and Institut de Génétique et Microbiologie, Centre Universitaire d'Orsay F-91405 Orsay, Cedex
1Service de Bioinformatique. CNRS-INSERM 7 rue Guy Moquet, BP 8, F-94801 Villejuif France

We present here a codification structure, entirely interfaced with the main packages for biomolecule database management, associated with a new search algorithm to retrieve quickly a sequence in a database. This system is derived from a method previously proposed for homology search in databanks with a preprocessed codification of an entire database in which all the overlapping subsequences of a specific length in a sequence were converted into a code and stored in a hash-coding file. This new algorithm is designed for an improved use of the codification. It is based on the recognition of the rarest strings which characterize the query sequence and the intersection of sorted lists read in the codification structure. The system is applicable to both nucleic acid and protein sequences and is used to find patterns in databanks or large sets of sequences. A few examples of applications are given. In addition, the comparison of our method with existing ones shows that this new approach speeds up the search for query patterns in large data sets.

Received on November 1, 1994; revised on March 1, 1995; accepted on March 6, 1995

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.