Follow
Peter Clote
Title
Cited by
Cited by
Year
DiANNA: a web server for disulfide connectivity prediction
F Ferrè, P Clote
Nucleic acids research 33 (suppl_2), W230-W232, 2005
3552005
Computational molecular biology: an introduction
P Clote, R Backofen
John Wiley, 2000
3392000
Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency
P Clote, F Ferré, E Kranakis, D Krizanc
Rna 11 (5), 578-591, 2005
2352005
DiANNA 1.1: an extension of the DiANNA web server for ternary cysteine classification
F Ferrè, P Clote
Nucleic acids research 34 (suppl_2), W182-W185, 2006
2302006
Disulfide connectivity prediction using secondary structure information and diresidue frequencies
F Ferrè, P Clote
Bioinformatics 21 (10), 2336-2346, 2005
1422005
Boolean functions and computation models
P Clote, E Kranakis
Springer Science & Business Media, 2002
1382002
Computation models and function algebras
P Clote
Studies in Logic and the Foundations of Mathematics 140, 589-681, 1999
133*1999
Integrating chemical footprinting data into RNA secondary structure prediction
K Zarringhalam, MM Meyer, I Dotu, JH Chuang, P Clote
Public Library of Science 7 (10), e45160, 2012
902012
On lattice protein structure prediction revisited
I Dotu, M Cebrian, P Van Hentenryck, P Clote
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (6 …, 2011
862011
RNAiFOLD: a constraint programming algorithm for RNA inverse folding and molecular design
JA Garcia-Martin, P Clote, I Dotu
Journal of bioinformatics and computational biology 11 (02), 1350001, 2013
792013
DIAL: a web server for the pairwise alignment of two RNA three-dimensional structures using nucleotide, dihedral angle and base-pairing similarities
F Ferrè, Y Ponty, WA Lorenz, P Clote
Nucleic acids research 35 (suppl_2), W659-W668, 2007
772007
First order bounded arithmetic and small boolean circuit complexity classes
P Clote, G Takeuti
Feasible Mathematics II, 154-218, 1995
751995
Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, AC k, NC k and NC
PG Clote
Feasible Mathematics, 49-69, 1990
711990
Members of countable Π10 classes
D Cenzer, P Clote, RL Smith, RI Soare, SS Wainer
Annals of Pure and Applied Logic 31, 145-163, 1986
581986
Efficient algorithms for probing the RNA mutation landscape
J Waldispühl, S Devadas, B Berger, P Clote
PLoS computational biology 4 (8), e1000124, 2008
572008
Cutting planes, connectivity, and threshold logic
SR Buss, P Clote
Archive for Mathematical Logic 35 (1), 33-62, 1996
571996
Boolean functions, invariance groups, and parallel complexity
P Colte, E Kranakis
SIAM Journal on Computing 20 (3), 553-590, 1991
571991
Algorithmic approach to quantifying the hydrophobic force contribution in protein folding
R Backofen, S Will, P Clote
Biocomputing 2000, 95-106, 1999
531999
An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic
A Razborov, P Clote
Arithmetic, proof theory and computational complexity 23, 247-277, 1993
531993
Bounded arithmetic for NC, ALogTIME, L and NL
P Clote, G Takeuti
Annals of pure and applied logic 56 (1-3), 73-117, 1992
501992
The system can't perform the operation now. Try again later.
Articles 1–20