Genome-Scale Algorithm Design

DOI10.1017/9781009341257MaRDI QIDQ6136235zbMATH OpenFDO

Authors Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu

Publication date 29 August 2023

Full work available at URL https://doi.org/10.1017/9781009341257

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to biology (92-02) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Recommendations

• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Algorithms in bioinformatics. A practical introduction.
• Algorithmic aspects of bioinformatics. Translated from the German original
• Bioinformatics Algorithms
• Distributed and sequential algorithms for bioinformatics

Cited in

(13)

• Deep sequencing data analysis
• Algorithms for genomics analysis
• Bioinformatics for high throughput sequencing
• Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
• Algorithms for next-generation sequencing data. Techniques, approaches, and applications
• Genome sequencing technology and algorithms.
• Bioinformatics. High performance parallel computer architectures
• Matching statistics -- a survey
• Applying the safe-and-complete framework to practical genome assembly
• Fast pattern matching with epsilon transitions
• A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
• How to find long maximal exact matches and ignore short ones
• Fast pattern matching with epsilon transitions

This page was built for publication: Genome-Scale Algorithm Design

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