2881 days ago
2875 days ago
2753 days ago
E-MEM: Efficient computation of Maximal Exact Matches
...source code can be downloaded here. If you use E-MEM, please cite: N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, ...2705 days ago
2700 days ago
2697 days ago
Many-to-many pairwise alignments of two sequence sets
...due or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix...2154 days ago
LAMSA: fast split read alignment with long approximate matches
LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long r...2189 days ago
Purge Haplotigs: Pipeline to help with curating heterozygous diploid genome assemblies
...rage and Minimap2 alignments to determine which contigs to keep for the haploid assembly. Dotplots are optionally produced for all flagged contig matches, juxtaposed with read-coverag...1973 days ago
1423 days ago