scientific article; zbMATH DE number 5074400

MaRDI QIDQ3409986zbMATH OpenFDO

Authors Lucian Ilie, Cristian Popescu

Publication date 21 November 2006

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Problems related to evolution (92D15)

Recommendations

• On the shortest common superstring of NGS reads
• Reoptimization of the shortest common superstring problem
• Approximating shortest superstring problem using de Bruijn graphs
• Implementation and Application of Automata
• Reoptimization of the Shortest Common Superstring Problem
• A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
• Approximation algorithms for the shortest common superstring problem
• scientific article; zbMATH DE number 3999290
• A greedy approximation algorithm for constructing shortest common superstrings

Cited in

(5)

• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Recognition of overlap graphs
• Viral Genome Compression
• FORMAL MODELLING OF VIRAL GENE COMPRESSION
• Implementation and Application of Automata

This page was built for publication:

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