Algorithmic aspects of bioinformatics. Translated from the German original

DOI10.1007/978-3-540-71913-7zbMath1131.68579OpenAlexW596897783MaRDI QIDQ885258

Dirk Bongartz, Hans-Joachim Böckenhauer

Publication date: 8 June 2007

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71913-7

zbMATH Keywords

string algorithmsDNA sequencingalignmentsbiological data

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical biology in general (92B99)

Related Items (9)

Algorithmic properties of ciliate sequence alignment ⋮ Efficient algorithms for three variants of the LPF table ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Reoptimization of the shortest common superstring problem ⋮ Using minimal absent words to build phylogeny ⋮ The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification ⋮ Building Phylogeny with Minimal Absent Words ⋮ Counting maximal-exponent factors in words ⋮ Reoptimization of the Shortest Common Superstring Problem

This page was built for publication: Algorithmic aspects of bioinformatics. Translated from the German original