The complexity of string partitioning (Q2343298)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	The complexity of string partitioning	scientific article

Statements

scholarly article

The complexity of string partitioning (English)

Journal of Discrete Algorithms

publication date

4 May 2015

zbMATH Keywords

string partitioning

equality-free

prefix-free

suffix-free

factor-free

NP-completeness

collision-aware oligo design

gene synthesis

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.jda.2014.11.002

A linear-time algorithm for testing the truth of certain quantified Boolean formulas

Sorting Strings by Reversals and by Transpositions

Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis

The Complexity of String Partitioning

\((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.

Minimum common string partition problem: hardness and approximations

Polynomial-time algorithm for computing translocation distance between genomes

A simpler and faster 1.5-approximation algorithm for sorting by transpositions

Mapping the genome

An Eulerian path approach to DNA fragment assembly

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:2343298

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2343298&oldid=35452935"