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