swMATH17256MaRDI QIDQ29117FDOQ29117
Author name not available (Why is that?)
Official website: http://mummer.sourceforge.net/
Cited In (47)
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- The longest almost-increasing subsequence
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- Replacing suffix trees with enhanced suffix arrays
- Space efficient linear time construction of suffix arrays
- Enumeration of maximal common subsequences between two strings
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
- Improvised divide and conquer approach for the LIS problem
- PSIST: a scalable approach to indexing protein structures using suffix trees
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- BioJava
- Chaining algorithms for multiple genome comparison
- SSAP
- DIALIGN
- LAGAN
- strmat
- BLAT
- AVID
- PatSearch
- PipMaker
- Genomatix
- SSAHA
- PatternHunter
- CLUSS
- BLASTZ
- Cgaln
- REPuter
- MoTeX
- MISHIMA
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
- Computing a longest common almost-increasing subsequence of two sequences
- HoloClean
- On the longest increasing subsequence of a circular list
- Algorithms and Computation
- Fast computation of a longest increasing subsequence and application
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Comparison of alignment free string distances for complete genome phylogeny
- Distributed suffix trees
- Bioinformatics. Volume I. Data, sequence analysis, and evolution
- A branch-and-cut algorithm for multiple sequence alignment
- Comparing bacterial genomes from linear orders of patterns
- Efficient algorithms for finding a longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
- DNA paired fragment assembly using graph theory
- Finding longest increasing and common subsequences in streaming data
This page was built for software: MUMMER
