Search arXiv⌕ Search

arXiv subjects

Song Liu

Publications and source records attributed to Song Liu.

219 records · Page 13Linked to original sources

Super-sensitive Molecule-hugging Graphene Nanopores

Longitudinal resolution and lateral sensitivity are decisive characteristics that determine the suitability of a nanopore sensor for sequencing a strand of DNA as well as other important polymers. Previous modeling of DNA induced ionic current blockades in single atom thick graphene nanopores has shown these nanopores to have sufficient longitudinal resolution to distinguish individual nucleobases along the length of a DNA molecule. Here we experimentally focus on the sensitivity to small changes in DNA diameter that can be discerned with graphene nanopores. We show that remarkably large sensitivities (0.5 nA/A)are obtained when the nanopore is tailored to have a diameter close to that of the polymer of interest. Our results have been obtained with double-stranded DNA (dsDNA). Smaller graphene nanopores that can be tuned to the diameter of single-stranded DNA (ssDNA) for sequencing have only recently been demonstrated. Our results indicate that nanopore sensors based on such pores will provide excellent resolution and base discrimination, and will be robust competitors to protein nanopores that have recently demonstrated sequencing capability.

physics.bio-ph↗

Generic Multiplicative Methods for Implementing Machine Learning Algorithms on MapReduce

In this paper we introduce a generic model for multiplicative algorithms which is suitable for the MapReduce parallel programming paradigm. We implement three typical machine learning algorithms to demonstrate how similarity comparison, gradient descent, power method and other classic learning techniques fit this model well. Two versions of large-scale matrix multiplication are discussed in this paper, and different methods are developed for both cases with regard to their unique computational characteristics and problem settings. In contrast to earlier research, we focus on fundamental linear algebra techniques that establish a generic approach for a range of algorithms, rather than specific ways of scaling up algorithms one at a time. Experiments show promising results when evaluated on both speedup and accuracy. Compared with a standard implementation with computational complexity $O(m^3)$ in the worst case, the large-scale matrix multiplication experiments prove our design is considerably more efficient and maintains a good speedup as the number of cores increases. Algorithm-specific experiments also produce encouraging results on runtime performance.

cs.DS↗

Unbound Protein-Protein Docking Selections by the DFIRE-based Statistical Pair Potential

A newly developed statistical pair potential based on Distance-scaled Finite Ideal-gas REference (DFIRE) state is applied to unbound protein-protein docking structure selections. The performance of the DFIRE energy function is compared to those of the well-established ZDOCK energy scores and RosettaDock energy function using the comprehensive decoy sets generated by ZDOCK and RosettaDock. Despite significant difference in the functional forms and complexities of the three energy scores, the differences in overall performance for docking structure selections are small between DFIRE and ZDOCK2.3 and between DFIRE and RosettaDock. This result is remarkable considering that a single-term DFIRE energy function was originally designed for monomer proteins while multiple-term energy functions of ZDOCK and RosettaDock were specifically optimized for docking. This provides hope that the accuracy of the existing energy functions for docking can be improved.

q-bio.BM↗