Highly scalable algorithms for robust string barcoding

DOI10.1007/11428848_129MaRDI QIDQ5709426zbMATH OpenOpenAlexFDO

Authors Bhaskar Dasgupta, Kishori M. Konwar, Ion Măndoiu, Alexander A. Schwarzmann

Publication date 30 November 2005

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

Full work available at URL https://doi.org/10.1007/b136571

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Faster Algorithm for the Set Variant of the String Barcoding Problem
• Parameterized lower bound and inapproximability of polylogarithmic string barcoding
• A symbol-based algorithm for decoding bar codes
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Stratifying the space of barcodes using Coxeter complexes
• Bar code decoding in a camera-based scanner: analysis and algorithm

Cited in

(2)

• Faster Algorithm for the Set Variant of the String Barcoding Problem
• Parameterized lower bound and inapproximability of polylogarithmic string barcoding

This page was built for publication: Highly scalable algorithms for robust string barcoding

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