Editorial: Special issue on algorithms for sequence analysis and storage
DOI10.3390/A7010186zbMATH Open1461.68015OpenAlexW1977045512MaRDI QIDQ1736610FDOQ1736610
Authors:
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a7010186
dynamic programmingpattern discoverycompressed index structureshigh-throughput sequencingpopulation simulation
Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Dynamic programming (90C39) Data structures (68P05) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- Practical compressed suffix trees
- Filtering degenerate patterns with application to protein sequence analysis
- Efficient \textit{in silico} chromosomal representation of populations via indexing ancestral genomes
- 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)
