Isoform reconstruction using short RNA-Seq reads by maximum likelihood is NP-hard

TL;DR

This paper demonstrates that reconstructing isoforms from short RNA-Seq reads using maximum likelihood is an NP-hard computational problem, highlighting its complexity.

Contribution

The paper proves that the problem of isoform reconstruction with maximum likelihood from short reads is NP-hard, establishing its computational difficulty.

Findings

Isoform reconstruction by maximum likelihood is NP-hard.

The complexity of the problem impacts computational approaches.

Highlights the need for heuristic or approximate methods.

Abstract

Maximum likelihood is a popular technique for isoform reconstruction. Here, we show that isoform reconstruction using short RNA-Seq reads by maximum likelihood is NP-hard.