In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STPMSPBEL), which asks for a tree interconnecting a given set of n terminal points andâ€¦ (More)

Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of nested arcs and a setâ€¦ (More)

Microarray data analysis is notorious for involving a huge number of genes compared to a relatively small number of samples. Gene selection is to detect the most significantly differentiallyâ€¦ (More)

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardnessâ€¦ (More)

Given a graph G = (V; E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u; v) 2 E if and onlyâ€¦ (More)

The $\mathrm{D}\mathrm{E}\mathrm{G}\mathrm{R}\mathrm{E}\mathrm{E}-\Delta$ CLOSEST PHYLOGENETIC $k\mathrm{T}\mathrm{H}$ Root PROBLEM $(\Delta \mathrm{C}\mathrm{P}\mathrm{R}k)$ is the problem ofâ€¦ (More)

In this paper, a new representation is presented for the Maximum Quartet Consistency (MQC) problem, where solving the MQC problem becomes searching for an ultrametric matrix that satisfies a maximumâ€¦ (More)

MOTIVATION
The availability of the whole genomic sequences of HIV-1 viruses provides an excellent resource for studying the HIV-1 phylogenies using all the genetic materials. However, such hugeâ€¦ (More)