<?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: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/36897?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/36897?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/45296/luo-lab-symbiosis-genomics-evolution</guid>
  <pubDate>Wed, 09 Sep 2026 03:30:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Luo Lab | Symbiosis Genomics &amp; Evolution]]></title>
  <description><![CDATA[
<p>We study the evolutionary genomics of marine invertebrates to understand their origins and diversity. Our lab combines high-throughput sequencing and single-cell transcriptomics to explore a wide range of non-model systems. We are particularly interested in how evolutionary novelty arises, with a focus on animal development and photosymbiosis.</p>

<p>Research Directions</p>

<p>Stony corals: evolution of novelty and photosymbiosis</p>

<p>Symbiotic acoels: cell type evolution and photosymbiosis</p>

<p>Animal genomes: structural evolution and gene regulation</p>

<p>https://sgel.biodiv.tw/home</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26390/przeworski-lab</guid>
  <pubDate>Mon, 15 Feb 2016 05:41:54 -0600</pubDate>
  <link></link>
  <title><![CDATA[Przeworski lab]]></title>
  <description><![CDATA[
<p>Genetic differences among individuals reflect the combined effects of mutation, recombination, population history and natural selection. As a result, studies of natural variation can provide important insights into evolutionary and genetic mechanisms: as examples, DNA sequence conservation among distantly related species can help identify functional roles too subtle to be detected in lab settings, while analyses of population variation allow for inferences about events that are too infrequent to be measured directly. Our research employs this general approach to learn about the dynamics of adaptation and the determinants of recombination and mutation, in humans and in other species.</p>

<p>More at http://przeworski.c2b2.columbia.edu/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/39302/understanding-reads-mapping-and-flags</guid>
	<pubDate>Thu, 25 Apr 2019 09:06:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/39302/understanding-reads-mapping-and-flags</link>
	<title><![CDATA[Understanding reads mapping and flags !]]></title>
	<description><![CDATA[<p><strong>Linear Alignment:</strong>&nbsp;An alignment of a read to a single reference sequence that may&nbsp;<q>include insertions, deletions, skips and clipping</q>,&nbsp;<span style="text-decoration: underline;">but may not include direction changes</span>&nbsp;(i.e. one portion of the alignment on forward strand and another portion of alignment on reverse strand).<sup id="fnref:1"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:1"><br /></a></sup></p><p><strong>Chimeric Alignment:</strong>&nbsp;An alignment of a read that cannot be represented as a linear alignment. Typically, one of the linear alignments in a chimeric alignment is considered the &ldquo;representative&rdquo; alignment, and the others are called &ldquo;supplementary&rdquo; and are distinguished by the supplementary alignment flag.<sup id="fnref:1:1"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:1"><br /></a></sup></p><p>Chimeric reads are indicative of structural variation in DNA-seq and it may indicate the presence of&nbsp;<a href="https://en.wikipedia.org/wiki/Chimeric_gene">chimeric genes</a>&nbsp;in RNA-seq.<sup id="fnref:2"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:2"><br /></a></sup></p><p>In short, chimeric reads can be split in to two or more parts, each part would be mapped to reference(it&rsquo;s not&nbsp;<a href="https://www.biostars.org/p/119537/">hard-clipped</a>), the total length of the mapped part is longger than read length.<sup id="fnref:3"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:3"><br /></a></sup></p><p><strong>Representative alignment:</strong>&nbsp;A chimeric alignment that is represented as a set of linear alignments that do not have large overlaps typically has one linear alignment that is considered the representative alignment.<sup id="fnref:4"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:4"><br /></a></sup></p><p>One read can align to multiple positions, we can find one alignmnet position which sequence do not have large overlaps, it called representative alighment, for other alignment positions, we called them supplementary alignment.</p><p>It seems that GATK can realignment those representative reads to the correctly position via&nbsp;<q>RealignerTargetCreator and IndelRealigner</q>. (WARNING: I am not quite sure if I understand this correctly. If someone could help me, please leave me a message below, thanks, thanks.)</p><p><strong>Supplementary Alignment:</strong>&nbsp;A chimeric reads but not a representative reads.</p><p><strong>Primary Alignment and Secondary Alignment:</strong>&nbsp;A read may map ambiguously to multiple locations, e.g. due to repeats.&nbsp;<strong>Only one of the multiple read alignments is considered primary</strong>,<span style="text-decoration: underline;">&nbsp;and this decision may be arbitrary</span>. All other alignments have the secondary alignment flag.<sup id="fnref:5"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:5"><br /></a></sup></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</guid>
	<pubDate>Tue, 19 Jun 2018 08:34:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</link>
	<title><![CDATA[Many-to-many pairwise alignments of two sequence sets]]></title>
	<description><![CDATA[needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue 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, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.<p>Address of the bookmark: <a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html" rel="nofollow">http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</guid>
	<pubDate>Mon, 10 Dec 2018 08:29:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</link>
	<title><![CDATA[BLAST options, setting and defaults]]></title>
	<description><![CDATA[<p>BLAST stands for Basic Local Alignment Search Tool and was developed by Altschul et al. (1990) and significantly improved by&nbsp;<a href="http://www3.oup.co.uk/nar/Volume_25/Issue_17/freepdf/">Altschul et al. (1997).</a>&nbsp;It is a very fast search algorithm that is used to separately search protein or DNA databases. BLAST is best used for sequence similarity searching, rather than for motif searching. For searches using a query sequence of fewer than twenty residues,&nbsp;<a href="https://www.arabidopsis.org/servlets/tools/patmatch/">PatMatch</a>&nbsp;is the best choice. Another sequence alignment tool that may yield different results from BLAST, and may be useful for motif searching, is&nbsp;<a href="https://www.arabidopsis.org/cgi-bin/fasta/TAIRfasta.pl">FASTA</a>. To search nonplant datasets, try&nbsp;<a href="http://seqsim.ncgr.org/newBlast.html">NCGR BLAST</a>&nbsp;or&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/blast.cgi?Jform=0">NCBI BLAST</a>.</p>
<p>A fairly complete on-line guide to BLAST searching can be found at the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/blast_help.html">NCBI BLAST Help Manual</a>. For a theoretical overview of BLAST, see the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/tutorial/Altschul-1.html">NCBI BLAST Course</a>. Additional information can be found in the&nbsp;<a href="https://www.arabidopsis.org/blast/aboutblast2.htm">BLAST 2.0 Release Notes</a></p>
<table border="1">
<tbody>
<tr><th>&nbsp;</th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTP</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">PSIBLAST</a></th></tr>
<tr>
<td><a name="open" id="open"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#open"><strong>Gap opening penalty</strong></a>:<br>cost to open a gap [integer]</td>
<td align="center">default = 5</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 5</td>
</tr>
<tr>
<td><a name="extend" id="extend"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#extend"><strong>Gap extension penalty</strong></a>:<br>cost to extend a gap [integer]</td>
<td align="center">default = 2</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 2</td>
</tr>
<tr>
<td><a name="match" id="match"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#match"><strong>Nucleic match</strong></a>:<br>reward for a match in the BLAST portion of run [integer]</td>
<td align="center">default = 1</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = 1</td>
</tr>
<tr>
<td><a name="mismatch" id="mismatch"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#mismatch"><strong>Nucleic mismatch</strong></a>:<br>penalty for a mismatch in the blast portion of run [integer]</td>
<td align="center">default = -3</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = -3</td>
</tr>
<tr>
<td><strong><a name="expect" id="expect"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#expect">Expectation value</a></strong>:<br>(E) [real]</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
</tr>
<tr>
<td><a name="word" id="word"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#word"><strong>Word size</strong></a>:<br>the size of the initial word that must be matched between the database and the query sequence</td>
<td align="center">default = 11</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 11</td>
</tr>
<tr>
<td><a name="descriptions" id="descriptions"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#descriptions"><strong>Max scores</strong></a>:<br>Number of one-line descriptions (V) [Integer]</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
</tr>
<tr>
<td><strong><a name="alignments" id="alignments"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#alignments">Max alignments</a></strong>:<br>number of alignments to show (B) [integer]</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
</tr>
<tr>
<td><strong>Query filter</strong>:<br>filter applied to the query sequence</td>
<td align="center">default = DUST</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = DUST</td>
</tr>
<tr>
<td><strong><a name="gencodes" id="gencodes"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#gencodes">Query genetic code</a></strong>:<br>genetic code to be used in BLASTX translation of the query</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">n/a</td>
</tr>
<tr>
<td><strong><a name="matrix" id="matrix"></a><a href="http://twod.med.harvard.edu/seqanal/matrices.html">Matrix</a></strong>:<br>substitution matrix to be used for amino acid comparisons</td>
<td align="center">no default</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">no default</td>
</tr>
</tbody>
</table>
<p>Supported and Suggested&nbsp;Values&nbsp;for Gap Open and Extension in BLASTP, BLASTX, TBLASTN, and TBLASTX</p>
<table border="1">
<tbody>
<tr><th>Gaps Open</th><th>Gap Extension</th></tr>
<tr>
<td align="center">10</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">10</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">11</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">9</td>
<td align="center">2</td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.arabidopsis.org/Blast/BLASToptions.jsp" rel="nofollow">https://www.arabidopsis.org/Blast/BLASToptions.jsp</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33003/surankco-supervised-ranking-of-contigs-in-de-novo-assemblies</guid>
	<pubDate>Wed, 24 May 2017 04:46:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33003/surankco-supervised-ranking-of-contigs-in-de-novo-assemblies</link>
	<title><![CDATA[SuRankCo: supervised ranking of contigs in de novo assemblies]]></title>
	<description><![CDATA[<p><span>SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which have no related reference genome yet.</span></p>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0644-7</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/surankco/" rel="nofollow">https://sourceforge.net/projects/surankco/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>