The recent boom in microfluidics and combinatorial indexing strategies, combined with low
sequencing costs, has empowered single-cell sequencing technology. Thousands—or even …

An instance of the Network Steiner Problem consists of an undirected graph with edge lengths
and a subset of vertices; the goal is to find a minimum cost Steiner tree of the given subset …

Computational omics methods packaged as software have become essential to modern
biological research. The increasing dependence of scientists on these powerful software tools …

Aligning sequencing reads onto a reference is an essential step of the majority of genomic
analysis pipelines. Computational algorithms for read alignment have evolved in accordance …

The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph
containing a given subset of vertices (terminals). We present a new polynomial-time …

Background and Purpose—It has been established that mitral annulus calcification (MAC) is
an independent predictor of stroke, though a causative relationship was not proved, and …

The classical Steiner tree problem in weighted graphs seeks a minimum weight connected
subgraph containing a given subset of the vertices (terminals). We present a new polynomial-…

The Steiner tree problem asks for the shortest tree connecting a given set of terminal points
in a metric space. We design new approximation algorithms for the Steiner tree problems …

Optimizing the energy consumption in wireless sensor networks has recently become the most
important performance objective. We assume the sensor network model in which sensors …

Background Massively parallel whole transcriptome sequencing, commonly referred as RNA-Seq,
is quickly becoming the technology of choice for gene expression profiling. However, …