scientific article; zbMATH DE number 6261402

zbMath1295.92011MaRDI QIDQ5397902

Enno Ohlebusch

Publication date: 25 February 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quartetssequence analysismultiple sequence alignmentapproximate string matchingBurrows-Wheeler transformrepeatsphylogenetic reconstructionrange minimum queriesstring comparisonwavelet treessplitsbidirectional searchKnuth-Morris-Pratt algorithmexact string matchingmaximal repeatsgenome rearrangementslowest common ancestorstring kernelsultrametric distanceLempel-Ziv factorizationAho-Corasick algorithmwhole 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

Mathematics Subject Classification ID

Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) General biology and biomathematics (92B05) Computational methods for problems pertaining to biology (92-08) Research exposition (monographs, survey articles) pertaining to biology (92-02) Algorithms on strings (68W32)

Related Items (31)

Engineering a lightweight external memory suffix array construction algorithm ⋮ Lightweight LCP construction for very large collections of strings ⋮ An improved algorithm for the all-pairs suffix-prefix problem ⋮ Lyndon array construction during Burrows-Wheeler inversion ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis ⋮ Tighter Bounds for the Sum of Irreducible LCP Values ⋮ Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints ⋮ Edge minimization in de Bruijn graphs ⋮ Algorithms to compute the Burrows-Wheeler similarity distribution ⋮ Efficient construction of the BWT for repetitive text using string compression ⋮ Linking indexing data structures to de Bruijn graphs: construction and update ⋮ On the optimisation of the GSACA suffix array construction algorithm ⋮ The longest common substring problem ⋮ Better External Memory LCP Array Construction ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ Full-Text Indexes for High-Throughput Sequencing ⋮ On the string matching with \(k\) mismatches ⋮ Tighter bounds for the sum of irreducible LCP values ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections ⋮ A practical semi-external memory method for approximate pattern matching ⋮ A simple algorithm for computing the document array ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ Solving string problems on graphs using the labeled direct product ⋮ LCP Array Construction in External Memory ⋮ Faster Compressed Suffix Trees for Repetitive Collections ⋮ String inference from longest-common-prefix array ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies ⋮ Online LZ77 Parsing and Matching Statistics with RLBWTs

This page was built for publication: