<?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/40699?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/40699?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</guid>
	<pubDate>Sun, 03 Apr 2022 20:35:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</link>
	<title><![CDATA[Merfin: improved variant filtering, assembly evaluation and polishing via k-mer validation]]></title>
	<description><![CDATA[<p><span>Merfin, a&nbsp;</span><em>k</em><span>-mer based variant-filtering algorithm for improved accuracy in genotyping and genome assembly polishing. Merfin evaluates each variant based on the expected&nbsp;</span><em>k</em><span>-mer multiplicity in the reads, independently of the quality of the read alignment and variant caller&rsquo;s internal score. Merfin increased the precision of genotyped calls in several benchmarks, improved consensus accuracy and reduced frameshift errors when applied to human and nonhuman assemblies built from Pacific Biosciences HiFi and continuous long reads or Oxford Nanopore reads, including the first complete human genome. Moreover, we introduce assembly quality and completeness metrics that account for the expected genomic copy numbers.</span></p>
<p><span>More at&nbsp;https://www.nature.com/articles/s41592-022-01445-y</span></p>
<p><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41592-022-01445-y/MediaObjects/41592_2022_1445_Fig1_HTML.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/arangrhie/merfin" rel="nofollow">https://github.com/arangrhie/merfin</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</guid>
	<pubDate>Wed, 19 Apr 2017 04:06:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</link>
	<title><![CDATA[ChromHMM: Chromatin state discovery and characterization]]></title>
	<description><![CDATA[<p><span>ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser.&nbsp;</span><br><br></p>
<ul>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM.zip">ChromHMM software v1.12</a>&nbsp;(<a href="http://compbio.mit.edu/ChromHMM/versionlog.txt">version log</a>)</li>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM_manual.pdf">ChromHMM manual</a></li>
</ul><p>Address of the bookmark: <a href="http://compbio.mit.edu/ChromHMM/" rel="nofollow">http://compbio.mit.edu/ChromHMM/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</guid>
	<pubDate>Mon, 12 Feb 2018 10:29:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</link>
	<title><![CDATA[Computational resources for TE discovery and TE detection]]></title>
	<description><![CDATA[<p><span>Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis. </span></p><p><span>Following are the list of r</span><span>esource and location for TE discovery and TE detection:</span></p><p>BLASTER suite&nbsp;http://urgi.versailles.inra.fr/development/blaster/&nbsp;</p><p>Censor&nbsp;http://www.girinst.org/censor/download.php&nbsp;</p><p>find_ltr&nbsp;http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl&nbsp;</p><p>FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm </p><p>HMMER http://hmmer.janelia.org/ </p><p>LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/ </p><p>LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html </p><p>LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7 </p><p>LTR_par http://www.eecs.wsu.edu/~ananth/software.htm </p><p>MAK http://wesslercluster.plantbio.uga.edu/mak06.html </p><p>MaskerAid http://blast.wustl.edu/maskeraid/ </p><p>mer-engine http://mer-engine.cshl.edu/mer-home.php </p><p>mreps http://bioinfo.lifl.fr/mreps/ </p><p>PILER http://www.drive5.com/piler/ </p><p>PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl </p><p>RepBase http://www.girinst.org/ </p><p>RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/ </p><p>RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm </p><p>RepeatMasker http://www.repeatmasker.org/ </p><p>RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html </p><p>RepeatScout http://repeatscout.bioprojects.org/ </p><p>repeat-match http://mummer.sourceforge.net/ </p><p>REPuter http://www.genomes.de/ </p><p>RetroMap http://www.burchsite.com/bioi/RetroMapHome.html </p><p>SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder </p><p>Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html </p><p>Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html </p><p>TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html </p><p>TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html </p><p>TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/ </p><p>Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm </p><p>WU-BLAST http://blast.wustl.edu</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</guid>
	<pubDate>Mon, 02 Dec 2019 06:52:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</link>
	<title><![CDATA[RepeatModeler2: automated genomic discovery of transposable element families]]></title>
	<description><![CDATA[<p><span>RepeatModeler2 represents a valuable addition to the genome annotation toolkit that will enhance the identification and study of TEs in eukaryotic genome sequences. RepeatModeler2 is available as source code or a containerized package under an open license (</span><a href="https://github.com/Dfam-consortium/RepeatModeler">https://github.com/Dfam-consortium/RepeatModeler</a><span>,&nbsp;</span><a href="https://github.com/Dfam-consortium/TETools">https://github.com/Dfam-consortium/TETools</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/Dfam-consortium/TETools" rel="nofollow">https://github.com/Dfam-consortium/TETools</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42035/pannzer-a-fully-automated-service-for-functional-annotation-of-prokaryotic-and-eukaryotic-proteins-of-unknown-function</guid>
	<pubDate>Thu, 13 Aug 2020 09:57:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42035/pannzer-a-fully-automated-service-for-functional-annotation-of-prokaryotic-and-eukaryotic-proteins-of-unknown-function</link>
	<title><![CDATA[PANNZER: a fully automated service for functional annotation of prokaryotic and eukaryotic proteins of unknown function.]]></title>
	<description><![CDATA[<p><strong>PANNZER</strong>&nbsp;(Protein ANNotation with Z-scoRE) is a fully automated service for functional annotation of prokaryotic and eukaryotic proteins of unknown function.</p>
<p><strong>PANNZER</strong>&nbsp;(Protein ANNotation with Z-scoRE) is a fully automated service for functional annotation of prokaryotic and eukaryotic proteins of unknown function. The tool is designed to predict the functional description (DE) and GO classes.</p>
<p>PANNZER2 processes bacterial proteomes in minutes and eukaryotic proteomes in an hour. You can use&nbsp;<a href="http://ekhidna2.biocenter.helsinki.fi/AAI/">AAI-profiler</a>&nbsp;to summarize a proteome's species neighbors and reveal taxonomic identity or contamination.</p><p>Address of the bookmark: <a href="http://ekhidna2.biocenter.helsinki.fi/sanspanz/#" rel="nofollow">http://ekhidna2.biocenter.helsinki.fi/sanspanz/#</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/3925/genome-annotation</guid>
	<pubDate>Sun, 25 Aug 2013 10:53:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/3925/genome-annotation</link>
	<title><![CDATA[Genome Annotation]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/on4TMnuYTaU" frameborder="0" allowfullscreen></iframe>Dr. Rob Edwards describes some of the problems, challenges, and approches in genome annotation, with a particular emphasis on how the Fellowship for the Interpretation of Genomes (FIG) developed subsystems using the SEED database available at http://www.theseed.org/]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32868/pollux-platform-independent-error-correction-of-single-and-mixed-genomes</guid>
	<pubDate>Fri, 19 May 2017 09:41:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32868/pollux-platform-independent-error-correction-of-single-and-mixed-genomes</link>
	<title><![CDATA[Pollux: platform independent error correction of single and mixed genomes]]></title>
	<description><![CDATA[<p><span>Pollux: General-purpose error corrector that corrects errors introduced by Illumina, Ion Torrent, and Roche 454 sequencing technologies and can be applied to single- or mixed-genome data. In addition to correcting substitution errors, we locate and correct insertion, deletion, and homopolymer errors while remaining sensitive to low coverage areas of sequencing projects. Using published data sets, we correct 94% of Illumina MiSeq errors, 88% of Ion Torrent PGM errors, 85% of Roche 454 GS Junior errors. Introduced errors are 20 to 70 times more rare than successfully corrected errors. Furthermore, we show that the quality of assemblies improves when reads are corrected by our software.</span></p>
<p><span>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-014-0435-6</span></p><p>Address of the bookmark: <a href="https://github.com/emarinier/pollux" rel="nofollow">https://github.com/emarinier/pollux</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44599/p10k-the-protist-10000-genomes</guid>
	<pubDate>Sat, 06 Jul 2024 08:29:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44599/p10k-the-protist-10000-genomes</link>
	<title><![CDATA[P10K: The Protist 10,000 Genomes]]></title>
	<description><![CDATA[<p><span>The Protist 10,000 Genomes (P10K) Project aims to decipher the genome sequences and construct a comprehensive database resource containing over 10,000 species of protists, encompassing representatives from every major clade. Samples were collected from diverse habitats, and the genome information was acquired through de novo sequencing, genome re-annotation, and integration of publicly available data. Serving as a centralized data portal for the project, the P10K database primarily focuses on delivering high-quality curation and facilitating efficient retrieval of protist genome data.</span></p><p>Address of the bookmark: <a href="https://ngdc.cncb.ac.cn/p10k/" rel="nofollow">https://ngdc.cncb.ac.cn/p10k/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</guid>
	<pubDate>Fri, 14 Jul 2017 07:47:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</link>
	<title><![CDATA[GView: A Java application for viewing and examining prokaryotic genomes in a circular or linear context]]></title>
	<description><![CDATA[<p>GView is a Java application for viewing and examining prokaryotic genomes in a circular or linear context. It accepts standard sequence file formats and an optional style specification file to generate customizable, publication quality genome maps in bitmap and scalable vector graphics formats. GView features an interactive pan-and-zoom interface, a command-line interface for incorporation in genome analysis pipelines, and a public Application Programming Interface for incorporation in other Java applications.</p>
<p><strong>Availability:</strong>&nbsp;GView is a freely available application licensed under the GNU Public License. The application, source code, documentation, file specifications, tutorials and image galleries are available at&nbsp;<a href="http://gview.ca/" target="pmc_ext">http://gview.ca</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">ac.cg.cpsa-cahp@raalesmod.nav.yrag</a></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>