scientific article; zbMATH DE number 5074400

zbMATH Open1157.68384MaRDI QIDQ3409986FDOQ3409986

Cristian Popescu, Lucian Ilie

Publication date: 21 November 2006

Title of this publication is not available (Why is that?)

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
• Publication:4725747
• A greedy approximation algorithm for constructing shortest common superstrings

Mathematics Subject Classification ID

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

Cited In (5)

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

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)