Optimizing Read Reversals for Sequence Compression

DOI10.1007/978-3-662-48221-6_14MaRDI QIDQ5283828zbMATH OpenOpenAlexFDO

Authors Zhong Sichen, Lu Zhao, Yan Liang, M. Zamani, R. Patro, Esther M. Arkin, Joseph S. B. Mitchell, Rezaul Alam Chowdhury, Steven Skiena

Publication date 25 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48221-6_14

zbMATH Keywords

2-factor approximationsequence compression

Mathematics Subject Classification ID

Algorithms on strings (68W32) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Dynamic alignment-free and reference-free read compression
• scientific article; zbMATH DE number 7716299
• Combinatorial Pattern Matching
• Improved compression of DNA sequencing data with cascading Bloom filters
• Compression of Whole Genome Alignments

Cites work

• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
• scientific article; zbMATH DE number 1559518 (Why is no real title available?)
• When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
• Worst-case analysis of a new heuristic for the travelling salesman problem

Cited in

(6)

• Dynamic alignment-free and reference-free read compression
• Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
• DeepMinimizer: a differentiable framework for optimizing sequence-specific minimizer schemes
• prefixMatching
• Unified View of Backward Backtracking in Short Read Mapping
• scientific article; zbMATH DE number 7716299 (Why is no real title available?)

Describes a project that uses

Uses Software

• SCALCE
• GitHub

This page was built for publication: Optimizing Read Reversals for Sequence Compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283828)