Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
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 Jonassen, I.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Jonassen, I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Efficient discovery of conserved patterns using a pattern graph

Inge Jonassen

Department of Informatics, University of Bergen Bergen, Norway

Motivation: We have previously reported an algorithm for discovering patterns conserved in sets of related unaligned protein sequences. The algorithm was implemented in a program called Pratt. Pratt allows the user to define a class of patterns (e.g. the degree of ambiguity allowed and the length and number of gaps), and is then guaranteed to find the conserved patterns in this class scoring highest according to a defined fitness measure. In many cases, this version of Pratt was very efficient, but in other cases it was too time consuming to be applied. Hence, a more efficient algorithm was needed.Results:In this paper, we describe a new and improved searching strategy that has two main advantages over the old strategy. First, it allows for easier integration with programs for multiple sequence alignment and data base search. Secondly, it makes it possible to use branch-and-bound search, and heuristics, to speed up the search. The new search strategy has been implemented in a new version of the Pratt program.Availability: The source code for the Pratt programs can be obtained via the World Wide Web: http:llwwMi.ii.uib.nol ingelPratt.html or usinganonymousftp from ftp://ftp.ii.uib.no/ pub/bio/Pratt.Contact:E-mail: inge{at}ii.uib.no

Received on November 18, 1996
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
T.-Y. Chien, D. T.-H. Chang, C.-Y. Chen, Y.-Z. Weng, and C.-M. Hsu
E1DS: catalytic site prediction based on 1D signatures of concurrent conservation
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W291 - W296.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
C.-M. Hsu, C.-Y. Chen, and B.-J. Liu
Corrigendum
Nucleic Acids Res., March 27, 2008; 36(4): 1400 - 1406.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
K. Ye, W. A. Kosters, and A. P. IJzerman
An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences
Bioinformatics, March 15, 2007; 23(6): 687 - 693.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
Y. Sun and J. Buhler
Designing patterns for profile HMM search
Bioinformatics, January 15, 2007; 23(2): e36 - e43.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Tempel, M. Giraud, D. Lavenier, I.-C. Lerman, A.-S. Valin, I. Couee, A. E. Amrani, and J. Nicolas
Domain organization within repeated DNA sequences: application to the study of a family of transposable elements
Bioinformatics, August 15, 2006; 22(16): 1948 - 1954.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
C.-M. Hsu, C.-Y. Chen, and B.-J. Liu
MAGIIC-PRO: detecting functional signatures by efficient discovery of long patterns in protein sequences.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W356 - W361.
[Abstract] [Full Text] [PDF]

Home page
 Plant Physiol.Home page
S. Bentolila, A.-L. Chateigner-Boutin, and M. R. Hanson
Ecotype Allelic Variation in C-to-U Editing Extent of a Mitochondrial Transcript Identifies RNA-Editing Quantitative Trait Loci in Arabidopsis
Plant Physiology, December 1, 2005; 139(4): 2006 - 2016.
[Abstract] [Full Text] [PDF]

Home page
 J. Virol.Home page
C. Carrillo, E. R. Tulman, G. Delhon, Z. Lu, A. Carreno, A. Vagnozzi, G. F. Kutish, and D. L. Rock
Comparative Genomics of Foot-and-Mouth Disease Virus
J. Virol., May 15, 2005; 79(10): 6487 - 6504.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
I. Alam, A. Dress, M. Rehmsmeier, and G. Fuellen
Comparative homology agreement search: An effective combination of homology-search methods
PNAS, September 21, 2004; 101(38): 13814 - 13819.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
N. Hulo, C. J. A. Sigrist, V. Le Saux, P. S. Langendijk-Genevaux, L. Bordoli, A. Gattiker, E. De Castro, P. Bucher, and A. Bairoch
Recent improvements to the PROSITE database
Nucleic Acids Res., January 1, 2004; 32(90001): D134 - 137.
[Abstract] [Full Text] [PDF]

Home page
 Mol Biol EvolHome page
M. Chioda, R. Eskeland, and E. M. Thompson
Histone Gene Complement, Variant Expression, and mRNA Processing in a Urochordate Oikopleura dioica that Undergoes Extensive Polyploidization
Mol. Biol. Evol., December 1, 2002; 19(12): 2247 - 2260.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
R. Apweiler, T. K. Attwood, A. Bairoch, A. Bateman, E. Birney, M. Biswas, P. Bucher, L. Cerutti, F. Corpet, M. D. R. Croning, et al.
The InterPro database, an integrated documentation resource for protein families, domains and functional sites
Nucleic Acids Res., January 1, 2001; 29(1): 37 - 40.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
A. Brazma, I. Jonassen, J. Vilo, and E. Ukkonen
Predicting Gene Regulatory Elements in Silico on a Genomic Scale
Genome Res., November 1, 1998; 8(11): 1202 - 1215.
[Abstract] [Full Text]


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.