Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (124K) 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 Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (33)
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Billoud, B
Right arrow Articles by Viari, A
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Billoud, B
Right arrow Articles by Viari, A
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, Vol 24, Issue 8 1395-1403, Copyright © 1996 by Oxford University Press


ARTICLES

Palingol: a declarative programming language to describe nucleic acids' secondary structures and to scan sequence database

B Billoud, M Kontic and A Viari
Atelier de Bio-informatique URA CNRS 448, Institut Curie, Paris, France.

At the DNA/RNA level, biological signals are defined by a combination of spatial structures and sequence motifs. Until now, few attempts had been made in writing general purpose search programs that take into account both sequence and structure criteria. Indeed, the most successful structure scanning programs are usually dedicated to particular structures and are written using general purpose programming languages through a complex and time consuming process where the biological problem of defining the structure and the computer engineering problem of looking for it are intimately intertwined. In this paper, we describe a general representation of structures, suitable for database scanning, together with a programming language, Palingol, designed to manipulate it. Palingol has specific data types, corresponding to structural elements-basically helices-that can be arranged in any way to form a complex structure. As a consequence of the declarative approach used in Palingol, the user should only focus on 'what to search for' while the language engine takes care of 'how to look for it'. Therefore, it becomes simpler to write a scanning program and the structural constraints that define the required structure are more clearly identified.
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
RNAHome page
P. Menzel, J. Gorodkin, and P. F. Stadler
The tedious task of finding homologous noncoding RNA genes
RNA, December 1, 2009; 15(12): 2075 - 2082.
[Abstract] [Full Text] [PDF]


Home page
RNAHome page
A. G. Vitreschak, A. A. Mironov, V. A. Lyubetsky, and M. S. Gelfand
Comparative genomic analysis of T-box regulatory systems in bacteria
RNA, April 1, 2008; 14(4): 717 - 735.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Reeder, J. Reeder, and R. Giegerich
Locomotif: from graphical motif description to RNA motif search
Bioinformatics, July 1, 2007; 23(13): i392 - i400.
[Abstract] [Full Text] [PDF]


Home page
RNAHome page
S. D. Baird, M. Turcotte, R. G. Korneluk, and M. Holcik
Searching for IRES
RNA, October 1, 2006; 12(10): 1755 - 1785.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
P. Thebault, S. de Givry, T. Schiex, and C. Gaspin
Searching RNA motifs and their intermolecular contacts with constraint networks
Bioinformatics, September 1, 2006; 22(17): 2074 - 2080.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
T.-H. Chang, H.-D. Huang, T.-N. Chuang, D.-M. Shien, and J.-T. Horng
RNAMST: efficient and flexible approach for identifying RNA structural homologs.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W423 - W428.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Lambert, J.-F. Fontaine, M. Legendre, F. Leclerc, E. Permal, F. Major, H. Putzer, O. Delfour, B. Michot, and D. Gautheret
The ERPIN server: an interface to profile-based RNA motif identification
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W160 - W165.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
D. A. Rodionov, A. G. Vitreschak, A. A. Mironov, and M. S. Gelfand
Comparative genomics of the methionine metabolism in Gram-positive bacteria: a variety of regulatory systems
Nucleic Acids Res., June 23, 2004; 32(11): 3340 - 3353.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
G. B. Fogel, V. W. Porto, D. G. Weekes, D. B. Fogel, R. H. Griffey, J. A. McNeil, E. Lesnik, D. J. Ecker, and R. Sampath
Discovery of RNA structural elements using evolutionary computation
Nucleic Acids Res., December 1, 2002; 30(23): 5310 - 5317.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
B. C. d'Orval, M.-L. Bortolin, C. Gaspin, and J.-P. Bachellerie
Box C/D RNA guides for the ribose methylation of archaeal tRNAs. The tRNATrp intron guides the formation of two ribose-methylated nucleosides in the mature tRNATrp
Nucleic Acids Res., November 15, 2001; 29(22): 4518 - 4529.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
T. J. Macke, D. J. Ecker, R. R. Gutell, D. Gautheret, D. A. Case, and R. Sampath
RNAMotif, an RNA secondary structure definition and search algorithm
Nucleic Acids Res., November 15, 2001; 29(22): 4724 - 4735.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
B. Billoud, M.-A. Guerrucci, M. Masselot, and J. S. Deutsch
Cirripede Phylogeny Using a Novel Approach: Molecular Morphometrics
Mol. Biol. Evol., October 1, 2000; 17(10): 1435 - 1445.
[Abstract] [Full Text] [PDF]



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.