Editorial: Special issue on algorithms for sequence analysis and storage

DOI10.3390/A7010186MaRDI QIDQ1736610zbMATH OpenOpenAlexFDO

Authors

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a7010186

zbMATH Keywords

compressed index structuresdynamic programminghigh-throughput sequencingpattern discoverypopulation simulation

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms (68W40) Dynamic programming (90C39) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Review text

Summary: This special issue of \textit{Algorithms} is dedicated to approaches to biological sequence analysis that have algorithmic novelty and potential for fundamental impact in methods used for genome research.

Cites work

• Efficient \textit{in silico} chromosomal representation of populations via indexing ancestral genomes
• Filtering degenerate patterns with application to protein sequence analysis
• Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
• Practical compressed suffix trees
• Sublinear time motif discovery from multiple sequences

This page was built for publication: Editorial: Special issue on algorithms for sequence analysis and storage

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