<?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/35041?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/35041?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</guid>
	<pubDate>Thu, 09 Apr 2020 18:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</link>
	<title><![CDATA[Submit your SARS-CoV-2 sequence data to GenBank]]></title>
	<description><![CDATA[<div dir="auto">Submit your SARS-CoV-2 sequence data to GenBank and SRA with our new submission landing page. Submission is simple and streamlined *and* there&rsquo;s a rapid turnaround. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fsubmit.ncbi.nlm.nih.gov%2Fsarscov2%2F%3Ffbclid%3DIwAR3p-OzZPe2yx4CZMoZxiWMF3kUQjXyVVduNQhBdehWmFTJ3cPBstsOLypI&amp;h=AT2d-umit7ciXRW-nrRYVL3gJSLKY4Hte8W8cXw8Wl94n6PGmoHmVqvvhgQj-mTo6A5lpMP9JDV_lRSq9RRLT5KeVVAAfcuRgJOeA6QhApIB2B9nFxUfDCD3sio4HYidpRwpmng&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://submit.ncbi.nlm.nih.gov/sarscov2/</a></span></div><div dir="auto">&nbsp;</div><div dir="auto"><span><span>Quickly and easily add your SARS-CoV-2 sequence data to the growing public archive with new, special features and support from NCBI. </span><a href="https://submit.ncbi.nlm.nih.gov/sarscov2/">new SARS-CoV-2 sequence submission landing page</a><span>&nbsp;will help you get started. GenBank submissions are accessioned and released in approximately 1-2 working days, and&nbsp;</span><a href="https://www.ncbi.nlm.nih.gov/sra" target="_blank">Sequence Read Archive</a><span>&nbsp;(SRA) submissions typically processed and released within hours. Submission is simple!</span></span></div><div><div dir="auto">&nbsp;</div><div dir="auto">More information is available on NCBI Insights. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fncbiinsights.ncbi.nlm.nih.gov%2F2020%2F04%2F09%2Fsars-cov2-data-streamlined-submission-rapid-turnaround%2F%3Ffbclid%3DIwAR1OuLu3oDjz3VX4fDq5Jg316td9foTOUGNqnoN1eI2nFXTf4EBv28JiXD4&amp;h=AT0ah_epxwAc-nM6QiPBYvKSQ-kWmiPgHKO1w7SnxnnRiTI4etJJfNAWyzcR7snIdtxtcErAFRdHPBH2j0EY77gUPDdnBVnAsxnVbSgZnrrOPfnni331A37Xvytgnye0ArnUuWk&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://ncbiinsights.ncbi.nlm.nih.gov/2020/04/09/sars-cov2-data-streamlined-submission-rapid-turnaround/</a></span></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43846/the-complete-sequence-of-a-human-genome</guid>
	<pubDate>Thu, 31 Mar 2022 23:58:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43846/the-complete-sequence-of-a-human-genome</link>
	<title><![CDATA[The complete sequence of a human genome]]></title>
	<description><![CDATA[<p><span>The completed regions include all centromeric satellite arrays, recent segmental duplications, and the short arms of all five acrocentric chromosomes, unlocking these complex regions of the genome to variational and functional studies.</span></p><p>Address of the bookmark: <a href="https://www.science.org/doi/10.1126/science.abj6987" rel="nofollow">https://www.science.org/doi/10.1126/science.abj6987</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41678/gridss-the-genomic-rearrangement-identification-software-suite</guid>
	<pubDate>Sun, 17 May 2020 10:27:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41678/gridss-the-genomic-rearrangement-identification-software-suite</link>
	<title><![CDATA[GRIDSS: the Genomic Rearrangement IDentification Software Suite]]></title>
	<description><![CDATA[<p>GRIDSS is a module software suite containing tools useful for the detection of genomic rearrangements. GRIDSS includes a genome-wide break-end assembler, as well as a structural variation caller for Illumina sequencing data. GRIDSS calls variants based on alignment-guided positional de Bruijn graph genome-wide break-end assembly, split read, and read pair evidence.</p><p>Address of the bookmark: <a href="https://github.com/PapenfussLab/gridss" rel="nofollow">https://github.com/PapenfussLab/gridss</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</guid>
	<pubDate>Thu, 22 Aug 2013 09:38:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</link>
	<title><![CDATA[Dynamic Programming Alignment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/EWJnDMKBEv0" frameborder="0" allowfullscreen></iframe>lecture 9, Chem. C100, Spring 2013, UCLA]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</guid>
	<pubDate>Wed, 22 Feb 2017 05:14:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</link>
	<title><![CDATA[Cgaln]]></title>
	<description><![CDATA[<p>Cgaln (Coarse grained alignment) is a program designed to align a pair of whole genomic sequences of not only bacteria but also entire chromosomes of vertebrates on a nominal desktop computer. Cgaln performs an alignment job in two steps, at the block level and then at the nucleotide level. The former "coarse-grained" alignment can explore genomic rearrangements and reduce the regions to be analyzed in the next step. The latter is devoted to detailed alignment within the limited regions found in the first stage. The output of Cgaln is 'glocal' in the sense that rearrangements are taken into consideration while each alignable region is extended as long as possible. Thus, Cgaln is not only fast and memory-efficient, but also can filter noisy outputs without missing the most important homologous segment pairs.</p>
<p>http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</p><p>Address of the bookmark: <a href="http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/" rel="nofollow">http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</guid>
	<pubDate>Fri, 12 May 2017 10:50:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</link>
	<title><![CDATA[A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs]]></title>
	<description><![CDATA[<p>PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:</p>
<p><a href="https://sourceforge.net/projects/abacas/files/">ABACAS</a>, that is able to contiguate contigs from a de novo assembly against a closely related reference.</p>
<p><a href="https://sourceforge.net/projects/image2/files/">IMAGE</a>, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.</p>
<p><a href="http://icorn.sourceforge.net/">iCORN</a>, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found&nbsp;<a href="ftp://ftp.sanger.ac.uk/pub4/resources/software/pagit/ICORN2/icorn2.V0.95.tgz">here</a>.</p>
<p><a href="https://ratt.svn.sourceforge.net/svnroot/ratt">RATT</a>, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.</p>
<p>PAGIT bundles these software and makes them more accessible for users.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/pagit" rel="nofollow">http://www.sanger.ac.uk/science/tools/pagit</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</guid>
	<pubDate>Wed, 24 May 2017 05:19:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</link>
	<title><![CDATA[AVID: A Global Alignment Program]]></title>
	<description><![CDATA[<p>A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36216/crusview</guid>
	<pubDate>Thu, 12 Apr 2018 09:22:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36216/crusview</link>
	<title><![CDATA[CrusView]]></title>
	<description><![CDATA[<p><span>CrusView&nbsp;is a java based tool for karyotype/genome visualization and comparison of crucifer&nbsp;Species. It also integrates an binary version of KGBassembler and a&nbsp;post-modification step for its assembling result.</span></p><p>Address of the bookmark: <a href="http://www.cmbb.arizona.edu/?page_id=250" rel="nofollow">http://www.cmbb.arizona.edu/?page_id=250</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>