Editorial: Special issue on algorithms for sequence analysis and storage
DOI10.3390/a7010186zbMath1461.68015OpenAlexW1977045512MaRDI QIDQ1736610
No author found.
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 discoverypopulation simulationcompressed index structureshigh-throughput sequencing
Analysis of algorithms (68W40) Dynamic programming (90C39) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Data structures (68P05)
Cites Work
- 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
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems