MUMMER

From MaRDI portal
Software:29117



swMATH17256MaRDI QIDQ29117


No author found.





Related Items (29)

Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromesA fast algorithm for computing a longest common increasing subsequenceA linear space algorithm for computing a longest common increasing subsequenceOn the longest increasing subsequence of a circular listDNA paired fragment assembly using graph theoryReplacing suffix trees with enhanced suffix arraysSpace-time trade-offs for finding shortest unique substrings and maximal unique matchesForest alignment with affine gaps and anchors, applied in RNA structure comparisonPSIST: a scalable approach to indexing protein structures using suffix treesAlgorithms and ComputationComparison of alignment free string distances for complete genome phylogenyFast computation of a longest increasing subsequence and applicationA divide and conquer approach and a work-optimal parallel algorithm for the LIS problemComputing a longest common almost-increasing subsequence of two sequencesComparing bacterial genomes from linear orders of patternsBioinformatics. Volume I. Data, sequence analysis, and evolutionImprovised divide and conquer approach for the LIS problemFinding longest increasing and common subsequences in streaming dataGAME: A simple and efficient whole genome alignment method using maximal exact match filteringLongest increasing subsequence under persistent comparison errorsEfficient algorithms for finding a longest common increasing subsequenceA Lagrangian relaxation approach for the multiple sequence alignment problemA diagonal-based algorithm for the longest common increasing subsequence problemThe longest almost-increasing subsequenceSpace efficient linear time construction of suffix arraysDistributed suffix treesChaining algorithms for multiple genome comparisonA branch-and-cut algorithm for multiple sequence alignmentEnumeration of maximal common subsequences between two strings


This page was built for software: MUMMER