21 citations · 21 across the 3 of their papers we have counts for
3 papers
cs.DS2018★ 21 cited
Efficient Learning of Optimal Markov Network Topology with k-Tree Modeling
Liang Ding, Di Chang, Russell Malmberg +5
The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a ma…
q-bio.BM2014
Ab initio Prediction of RNA Nucleotide Interactions with Backbone k-Tree Model
Liang Ding, Xingran Xue, Sal LaMarca +4
Given the importance of non-coding RNAs to cellular regulatory functions and rapid growth of RNA transcripts, computational prediction of RNA tertiary structure remains highly dema…
cs.CC2013
Polynomial kernels collapse the W-hierarchy
Liang Ding, Abdul Samad, Xingran Xue +2
We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the W-hierarchy (i.e., W[P] = FPT). The collapsing resu…