<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: LAMSA: fast split read alignment with long approximate matches]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches?</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[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 reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink='true'>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches#item-annotation-3433</guid>
	<pubDate>Fri, 13 Jul 2018 17:49:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches#item-annotation-3433</link>
	<title><![CDATA[Comment by Jit]]></title>
	<description><![CDATA[<p>➜ LAMSA git:(master) ./lamsa aln</p>
<p>Usage: lamsa aln [options] &lt;ref.fa&gt; &lt;read.fa/fq&gt;</p>
<p>Algorithm options:</p>
<p>-t --thread [INT] Number of threads. [1]<br> -l --seed-len [INT] Length of seeding fragments. [50]<br> -i --seed-inv [INT] Distance between neighboring seeding fragments. [100]<br> -p --max-loci [INT] Maximum allowed number of seeding fragments' hits. [200]<br> -V --SV-len [INT] Expected maximum length of SV. [10000]<br> -v --ovlp-rat [FLOAT] Minimum overlapping ratio to cluster two skeletons or alignment records.<br> [0.70]<br> -s --max-skel [INT] Maximum number of skeletons that are reserved in a cluster. [10]<br> -R --max-reg [INT] Maximum allowed length of unaligned read part to trigger a bwt-based query.<br> [300]<br> -k --bwt-kmer [INT] Length of BWT-seed. [19]<br> -f --fastest Use GEM-mapper's fastest mode(--fast-mapping=0). [false]</p>
<p>Scoring options:</p>
<p>-m --match-sc [INT] Match score for SW-alignment. [1]<br> -M --mis-pen [INT] Mismatch penalty for SW-alignment. [3]<br> -O --open-pen [INT(,INT,INT,INT)]<br> Gap open penalty for SW-alignment(end2end-global: insertion, deletion,<br> one-end-extend: insertion, deletion). [5(,5,5,5)]<br> -E --ext-pen [INT(,INT,INT,INT)]<br> Gap extension penalty for SW-alignment(end2end-global: insertion, deletion,<br> one-end-extend: insertion, deletion). [2(,2,2,2)]<br> -w --band-width[INT] Band width for banded-SW. [10]<br> -b --end-bonus [INT] Penalty for end-clipping. [5]</p>
<p>Read options:</p>
<p>-e --err-rate [FLOAT] Maximum error rate of read. [0.04]<br> -d --diff-rate [FLOAT] Maximum length difference ratio between read and reference. [0.04]<br> -x --mis-rate [FLOAT] Maximum error rate of mismatch within reads. [0.04]</p>
<p>-T --read-type [STR] Specifiy the type of reads and set multiple parameters unless overriden.<br> [null] (Illumina Moleculo)<br> pacbio (PacBio SMRT): -i25 -l50 -m1 -M1 -O1,1,2,2 -E1,1,1,1 -w200 -b0 -e0.30 -d0.30<br> ont2d (Oxford Nanopore): -i25 -l50 -m1 -M1 -O1,1,1,1 -E1,1,1,1 -w100 -b0 -e0.25 -d0.10</p>
<p>Output options:</p>
<p>-r --max-out [INT] Maximum number of output records for a specific split read region. [10]<br> -g --gap-split [INT] Minimum length of gap that causes a split-alignment. [100]<br> -S --soft-clip Use soft clipping for supplementary alignment. [false]<br> -C --comment Append FASTQ comment to SAM output. [false]<br> -o --output [STR] Output file (SAM format). [stdout]</p>
<p>-h --help Print this short usage.<br> -H --HELP Print a detailed usage.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>