Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
quartetssequence analysisphylogenetic reconstructionrange minimum queriesstring comparisonwavelet treesmultiple sequence alignmentsplitsbidirectional searchapproximate string matchingKnuth-Morris-Pratt algorithmexact string matchingBurrows-Wheeler transformmaximal repeatsgenome rearrangementslowest common ancestorstring kernelsultrametric distanceLempel-Ziv factorizationAho-Corasick algorithmrepeatswhole genome alignmentpairwise sequence alignmentBoyer-Moore-Horspool algorithmLCP-arraybioinformatics algorithmscompressed full text indexescompressed suffix and LCP arraysenhanced suffix arraysLCP-interval treemultiple string comparisonneighbour joining algorithmsnon-additive dissimilarity matricesreversals sortingspace efficient string comparisontransversals with suffix linksUPGMA algorithm
Genetics and epigenetics (92D10) Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Research exposition (monographs, survey articles) pertaining to biology (92-02) Computational methods for problems pertaining to biology (92-08) General biology and biomathematics (92B05) Algorithms on strings (68W32)
- Algorithms in bioinformatics. A practical introduction.
- Algorithms on Strings, Trees and Sequences
- Fundamentals of bioinformatics and computational biology. Methods and exercises in MATLAB
- Algorithms in bioinformatics. 1st international workshop, WABI 2001, Århus, Denmark, August 28--31, 2001. Proceedings
- Construction of Fundamental Data Structures for Strings
- Full-text indexes for high-throughput sequencing
- Genome-Scale Algorithm Design
- Bioinformatics Algorithms
- Edge minimization in de Bruijn graphs
- String inference from longest-common-prefix array
- LCP array construction in external memory
- A simple algorithm for computing the document array
- Engineering a lightweight external memory suffix array construction algorithm
- Algorithmic aspects of bioinformatics. Translated from the German original
- Algorithms for genomics analysis
- On the optimisation of the GSACA suffix array construction algorithm
- Lyndon array construction during Burrows-Wheeler inversion
- Online LZ77 parsing and matching statistics with RLBWTs
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Lightweight LCP construction for very large collections of strings
- Computing MEMs and relatives on repetitive text collections
- Generic non-recursive suffix array construction
- How to find long maximal exact matches and ignore short ones
- Computing the original eBWT faster, simpler, and with less memory
- An improved algorithm for the all-pairs suffix-prefix problem
- Genome sequencing technology and algorithms.
- Better external memory LCP array construction
- Algorithms in bioinformatics. A practical introduction.
- Efficient construction of the BWT for repetitive text using string compression
- Optimal suffix sorting and LCP array construction for constant alphabets
- Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
- Efficient construction of a compressed de Bruijn graph for pan-genome analysis
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- Tighter bounds for the sum of irreducible LCP values
- Comparative genomics with succinct colored de Bruijn graphs
- Parallel computation of the Burrows Wheeler transform in compact space
- Reporting consecutive substring occurrences under bounded gap constraints
- Approximate Cartesian tree matching with one difference
- Tighter bounds for the sum of irreducible LCP values
- Burrows-Wheeler transform and LCP array construction in constant space
- Faster compressed suffix trees for repetitive collections
- Solving string problems on graphs using the labeled direct product
- Inducing the Lyndon array
- The longest common substring problem
- On the string matching with \(k\) mismatches
- scientific article; zbMATH DE number 2131247 (Why is no real title available?)
- Linking indexing data structures to de Bruijn graphs: construction and update
- Inducing enhanced suffix arrays for string collections
- A practical semi-external memory method for approximate pattern matching
This page was built for publication: Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397902)
