| DiANNA: a web server for disulfide connectivity prediction F Ferrè, P Clote Nucleic acids research 33 (suppl_2), W230-W232, 2005 | 426 | 2005 |
| Computational molecular biology an introduction S Levin Wiley, 2000 | 371 | 2000 |
| 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 | 269 | 2006 |
| 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 | 266 | 2005 |
| Boolean functions and computation models P Clote, E Kranakis Springer Science & Business Media, 2013 | 158 | 2013 |
| Disulfide connectivity prediction using secondary structure information and diresidue frequencies F Ferrè, P Clote Bioinformatics 21 (10), 2336-2346, 2005 | 157 | 2005 |
| Computation models and function algebras P Clote Studies in Logic and the Foundations of Mathematics 140, 589-681, 1999 | 153* | 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 | 127 | 2012 |
| 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 | 121 | 2013 |
| 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 | 92 | 2011 |
| 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 | 84 | 2007 |
| First order bounded arithmetic and small boolean circuit complexity classes P Clote, G Takeuti Feasible Mathematics II, 154-218, 1995 | 82 | 1995 |
| Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, ACk, NCkand NC PG Clote Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca …, 1990 | 74 | 1990 |
| Interpretability and fragments of arithmetic P Hájek, P Clote Arithmetic, proof theory, and computational complexity 23, 185-196, 1993 | 71 | 1993 |
| Members of countable Π10 classes D Cenzer, P Clote, RL Smith, RI Soare, SS Wainer Annals of Pure and Applied Logic 31, 1986 | 64 | 1986 |
| Efficient algorithms for probing the RNA mutation landscape J Waldispühl, S Devadas, B Berger, P Clote PLoS computational biology 4 (8), e1000124, 2008 | 62 | 2008 |
| Cutting planes, connectivity, and threshold logic SR Buss, P Clote Archive for Mathematical Logic 35 (1), 33-62, 1996 | 60 | 1996 |
| Boolean functions, invariance groups, and parallel complexity P Colte, E Kranakis SIAM Journal on Computing 20 (3), 553-590, 1991 | 58 | 1991 |
| Algorithmic approach to quantifying the hydrophobic force contribution in protein folding R Backofen, S Will, P Clote Biocomputing 2000, 95-106, 1999 | 55 | 1999 |
| Bounded arithmetic for NC, ALogTIME, L and NL P Clote, G Takeuti Annals of pure and applied logic 56 (1-3), 73-117, 1992 | 55 | 1992 |
ivan dotuMoirai BiodesignVerified email at moiraibiodesign.com
