Viral Genome Compression

DOI10.1007/11925903_9MaRDI QIDQ5452566zbMATH OpenOpenAlexFDO

Authors Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill

Publication date 4 April 2008

Published in DNA Computing (Search for Journal in Brave)

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

zbMATH Keywords

approximate solutionsexact algorithmsgenome compressionlower boundsoverlapping genesshortest common superstring problemviral genomesviruses

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10)

Recommendations

• scientific article; zbMATH DE number 5074400
• Implementation and Application of Automata
• Shortest common superstrings of random strings
• Greedy algorithms for the shortest common superstring that are asymtotically optimal
• Greedy algorithms for the shortest common superstring that are asymptotically optimal

Cited in

(4)

• Recognition of overlap graphs
• Virus Bioinformatics
• FORMAL MODELLING OF VIRAL GENE COMPRESSION
• Implementation and Application of Automata

This page was built for publication: Viral Genome Compression

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