Liming Cai

According to our database1, Liming Cai authored at least 57 papers between 1993 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Accurate prediction of human miRNA targets via graph modeling of the miRNA-target duplex.
J. Bioinformatics and Computational Biology, 2018

2016
A New Graph Theoretic Approach for Protein Threading.
Fundam. Inform., 2016

Genome-wide identification and evolutionary analysis of long non-coding RNAs in cereals.
Proceedings of the 6th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2016

Accurate prediction of human miRNA targets via graph modeling of miRNA-target duplex.
Proceedings of the 6th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2016

2015
Accurate prediction of RNA nucleotide interactions with backbone k-tree model.
Bioinformatics, 2015

Big data - a 21st century science Maginot Line? No-boundary thinking: shifting from the big data paradigm.
BioData Mining, 2015

2014
Dynamics of Mosquitoes Populations with Different Strategies for Releasing Sterile Mosquitoes.
SIAM Journal of Applied Mathematics, 2014

Analysis of an extended HIV/AIDS epidemic model with treatment.
Applied Mathematics and Computation, 2014

Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling.
Proceedings of the Language and Automata Theory and Applications, 2014

Ab initio Prediction of RNA Nucleotide Interactions with Backbone k-Tree Model.
Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014

2013
Patterns of Chromatin-Modifications Discriminate Different Genomic Features in Arabidopsis.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Protein Closed Loop Prediction from Contact Probabilities.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012
TRFolder-W: a web server for telomerase RNA structure prediction in yeast genomes.
Bioinformatics, 2012

2011
Analyzing Modular RNA Structure reveals Low Global Structural Entropy in microRNA Sequence.
J. Bioinformatics and Computational Biology, 2011

TRFolder: computational prediction of novel telomerase RNA structures in yeast genomes.
IJBRA, 2011

Stable stem enabled shannon entropies distinguish non-coding RNAs from random backgrounds.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Simultaneous Prediction of RNA Secondary Structure and Helix Coaxial Stacking.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010
RNApasta: a tool for analysis of RNA structural alignments.
IJBRA, 2010

2009
RNATOPS-W: a web server for RNA structure searches of genomes.
Bioinformatics, 2009

2008
Parameterized Complexity and Biopolymer Sequence Comparison.
Comput. J., 2008

Fast and accurate search for non-coding RNA pseudoknot structures in genomes.
Bioinformatics, 2008

2007
The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst., 2007

Comparative Pathway Annotation with Protein-DNA Interaction and Operon Information via Graph Tree Decomposition.
Proceedings of the Biocomputing 2007, 2007

Comparative Pathway Prediction Via Unified Graph Modeling of Genomic Structure Information.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Operon Prediction in Microbial Genomes Using Decision Tree Approach.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2007

2006
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment.
IEEE/ACM Trans. Comput. Biology Bioinform., 2006

Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots.
IJBRA, 2006

Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Phylogenetic Network Inferences Through Efficient Haplotyping.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Fast De novo Peptide Sequencing and Spectral Alignment via Tree Decomposition.
Proceedings of the Biocomputing 2006, 2006

Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Peptide sequence tag-based blind identification of post-translational modifications with point process model.
Proceedings of the Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, 2006

Learning the Parameters of Stochastic Grammar Models for RNA Structures with Pseudoknots.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

2005
Preface.
J. Comput. Sci. Technol., 2005

RNA Structural Homology Search with a Succinct Stochastic Grammar Model.
J. Comput. Sci. Technol., 2005

BEST: Binding-site Estimation Suite of Tools.
Bioinformatics, 2005

Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Profiling and Searching for RNA Pseudoknot Structures in Genomes.
Proceedings of the Computational Science, 2005

Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005

2003
On the existence of subexponential parameterized algorithms.
J. Comput. Syst. Sci., 2003

Stochastic modeling of RNA pseudoknotted structures: a grammatical approach.
Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology, June 29, 2003

2001
Subexponential Parameterized Algorithms Collapse the W-Hierarchy.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1998
The Inapproximability of Non NP-hard Optimization Problems.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
On the Amount of Nondeterminism and the Power of Verifying.
SIAM J. Comput., 1997

On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.
J. Comput. Syst. Sci., 1997

Advice Classes of Parameterized Tractability.
Ann. Pure Appl. Logic, 1997

On the parameterized complexity of short computation and factorization.
Arch. Math. Log., 1997

Circuit Bottom Fan-in and Computational Power.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

A Grammar Characterization of Logarithmic-Space Computation.
Proceedings of the New Trends in Formal Languages, 1997

1996
The Computational Complexity of Linear PCGSs.
Computers and Artificial Intelligence, 1996

1995
On Input Read-Modes of Alternating Turing Machines.
Theor. Comput. Sci., 1995

On the Structure of Parameterized Problems in NP.
Inf. Comput., 1995

The Computational Complexity of PCGS with Regular Components.
Proceedings of the Developments in Language Theory II, 1995

On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
On the Structure of Parameterized Problems in NP (Extended Abstract).
Proceedings of the STACS 94, 1994

1993
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993


  Loading...