Jérôme Waldispühl

Author Info

Name	Affiliation	Papers
JÉRÔME WALDISPÜHL	Department of Mathematics, MIT, Cambridge, USA and Computer Science and AI Lab, MIT, Cambridge, USA	37
Collaborators	Citations	PageRank
61	111	16.24
Referers	Referees	References
228	555	306

Search Limit

100555

Publications (37 rows)

Collaborators (61 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Finding Recurrent Rna Structural Networks With Fast Maximal Common Subgraphs Of Edge-Colored Graphs	0	0.34	2021
Stochastic Sampling of Structural Contexts Improves the Scalability and Accuracy of RNA 3D Module Identification.	0	0.34	2020
incaRNAfbinv 2.0 - A webserver and software with motif control for fragment-based design of RNAs.	0	0.34	2020
Optimol: Optimization Of Binding Affinities In Chemical Space For Drug Discovery	1	0.35	2020
Fast and Flexible Coarse-grained Prediction of Protein Folding Routes using Ensemble Modelling and Evolutionary Sequence Variation.	0	0.34	2020
Predicting Positions of Bridging Water Molecules in Nucleic Acid-Ligand Complexes.	0	0.34	2019
Ten simple rules to create a serious game, illustrated with examples from structural biology.	1	0.38	2018
Design of RNAs: comparing programs for inverse RNA folding.	3	0.39	2018
Computational Intractability Generates the Topology of Biological Networks	0	0.34	2017
10 simple rules to create a serious game, illustrated with examples from structural biology.	0	0.34	2017
Lessons from an Online Massive Genomics Computer Game.	1	0.36	2017
On Stable States in a Topologically Driven Protein Folding Model.	0	0.34	2017
RNA-MoIP: prediction of RNA secondary structure and local 3D motifs from sequence data.	1	0.40	2017
incaRNAfbinv: a web server for the fragment-based design of RNA sequences.	1	0.35	2016
Investigating Mutations to Reduce Huntingtin Aggregation by Increasing Htt-N-Terminal Stability and Weakening Interactions with PolyQ Domain.	0	0.34	2016
Collaborative Solving in a Human Computing Game Using a Market, Skills and Challenges.	1	0.37	2016
Exploration of the Dynamic Properties of Protein Complexes Predicted from Spatially Constrained Protein-Protein Interaction Networks.	0	0.34	2014
Phylo and Open-Phylo: A Human-Computing Platform for Comparative Genomics.	0	0.34	2014
SPARCS: a web server to analyze (un)structured regions in coding RNA sequences.	1	0.35	2013
A weighted sampling algorithm for the design of RNA sequences with targeted secondary structure and nucleotide distribution.	14	0.72	2013
A linear inside-outside algorithm for correcting sequencing errors in structured RNAs	1	0.39	2013
Flexible RNA design under structure and sequence constraints using formal languages	4	0.44	2013
Using structural and evolutionary information to detect and correct pyrosequencing errors in noncoding RNAs.	0	0.34	2013
Towards 3D structure prediction of large RNA molecules: an integer programming framework to insert local 3D motifs in RNA secondary structure.	3	0.53	2012
Efficient traversal of beta-sheet protein folding pathways using ensemble models.	1	0.36	2011
corRna: a web server for predicting multiple-point deleterious mutations in structural RNAs.	3	0.43	2011
An unbiased adaptive sampling algorithm for the exploration of RNA mutational landscapes under evolutionary pressure.	7	0.61	2011
A method for probing the mutational landscape of amyloid structure	7	0.62	2011
Simultaneous alignment and folding of protein sequences.	1	0.36	2009
RNAmutants: a web server to explore the mutational landscape of RNA secondary structures.	6	0.54	2009
Efficient Algorithms For Probing The Rna Mutation Landscape	17	1.01	2008
Computing the partition function and sampling for saturated secondary structures of RNA, with respect to the Turner energy model.	7	0.54	2007
transFold: a web server for predicting the structure and residue contacts of transmembrane beta-barrels.	6	0.48	2006
Modeling and predicting all-α transmembrane proteins including helix-helix pairing	7	0.57	2005
Energy landscape of k-point mutants of an RNA molecule.	8	0.62	2005
Preface.	0	0.34	2004
An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.	9	0.69	2002