The following pages link to MUMMER (Q29117):
Displaying 29 items.
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison (Q390877) (← links)
- PSIST: a scalable approach to indexing protein structures using suffix trees (Q436643) (← links)
- Bioinformatics. Volume I. Data, sequence analysis, and evolution (Q505398) (← links)
- The longest almost-increasing subsequence (Q765507) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- On the longest increasing subsequence of a circular list (Q845894) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- DNA paired fragment assembly using graph theory (Q1662696) (← links)
- Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Comparison of alignment free string distances for complete genome phylogeny (Q2442771) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering (Q2500318) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- Algorithms and Computation (Q5191664) (← links)
- Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
