<?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/38481?offset=490</link>
	<atom:link href="https://bioinformaticsonline.com/related/38481?offset=490" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44537/the-atcc-genome-portal</guid>
	<pubDate>Wed, 15 May 2024 14:24:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44537/the-atcc-genome-portal</link>
	<title><![CDATA[The ATCC Genome Portal]]></title>
	<description><![CDATA[<p><span>The ATCC Genome Portal (AGP,&nbsp;</span><a href="https://genomes.atcc.org/">https://genomes.atcc.org/</a><span>) is a database of authenticated genomes for bacteria, fungi, protists, and viruses held in ATCC&rsquo;s biorepository. It now includes 3,938 assemblies (253% increase) produced under ISO 9000 by ATCC. Here, we present new features and content added to the AGP for the research community.</span></p><p>Address of the bookmark: <a href="https://genomes.atcc.org/" rel="nofollow">https://genomes.atcc.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44489/proksee</guid>
	<pubDate>Wed, 27 Mar 2024 11:11:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44489/proksee</link>
	<title><![CDATA[Proksee]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p>
<fieldset><legend>Please Cite the Following</legend>
<div>Grant JR, Enns E, Marinier E, Mandal A, Herman EK, Chen C, Graham M, Van Domselaar G, and Stothard P</div>
<div><a href="https://pubmed.ncbi.nlm.nih.gov/37140037/">Proksee: in-depth characterization and visualization of bacterial genomes</a></div>
<div>Nucleic Acids Research, 2023, gkad326, https://doi.org/10.1093/nar/gkad326</div>
</fieldset><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</guid>
	<pubDate>Mon, 05 Aug 2024 23:01:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</link>
	<title><![CDATA[UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment]]></title>
	<description><![CDATA[<p>UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment</p>
<ul>
<li>
<p>Using state of the art tools, easily extended for other viruses</p>
</li>
<li>
<p>Tool and database updates for critical components via Conda</p>
</li>
<li>
<p>Built using modern design patterns with Conda and Snakemake</p>
</li>
<li>
<p>Extensible and easy to customize</p>
</li>
<li>
<p>Submission Ready Genomes</p>
</li>
<li>
<p>Customizable reporting with comprehensive visualization</p>
</li>
</ul>
<p>https://ikim-essen.github.io/uncovar/</p>
<p>Github&nbsp;https://github.com/IKIM-Essen/uncovar</p>
<p>&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ikim-essen.github.io/uncovar/" rel="nofollow">https://ikim-essen.github.io/uncovar/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44754/early-genome-screening-the-new-health-horoscope</guid>
	<pubDate>Thu, 02 Jan 2025 19:44:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44754/early-genome-screening-the-new-health-horoscope</link>
	<title><![CDATA[Early Genome Screening: The New Health Horoscope!]]></title>
	<description><![CDATA[<p>In an era where precision medicine is reshaping healthcare, genome screening is emerging as the modern equivalent of a health horoscope. It offers insights into our biological "stars," unraveling predispositions to various conditions and empowering individuals with knowledge to navigate their health journeys proactively. But how reliable is this "horoscope," and how does it impact our lives?</p><h3>Understanding Genome Screening</h3><p>Genome screening involves analyzing an individual's DNA to identify genetic variations that may influence health and disease susceptibility. This can range from simple single-gene tests to comprehensive whole-genome sequencing. By peering into our genetic blueprint, we can uncover risks for conditions like cancer, diabetes, cardiovascular diseases, and even rare genetic disorders.</p><p>The process is straightforward: a saliva or blood sample is collected, and advanced sequencing technologies decipher the genetic code. The results provide a personalized health map, guiding lifestyle modifications, preventive measures, or medical interventions.</p><h3>A Shift from Reactive to Proactive Healthcare</h3><p>Traditional healthcare often focuses on treating diseases after they manifest. Genome screening flips this model on its head, enabling a shift toward prevention and early intervention. For instance:</p><ul>
<li>
<p><strong>Cancer Risk Management</strong>: Individuals with BRCA1 or BRCA2 gene mutations can opt for enhanced screening programs or preventive surgeries to mitigate their risk of breast and ovarian cancers.</p>
</li>
<li>
<p><strong>Cardiovascular Health</strong>: Genetic predispositions to conditions like familial hypercholesterolemia can prompt early cholesterol monitoring and lifestyle adjustments.</p>
</li>
<li>
<p><strong>Rare Diseases</strong>: Identifying carriers of genetic disorders can aid in family planning and reduce the incidence of inherited conditions.</p>
</li>
</ul><h3>The Ethical and Practical Concerns</h3><p>While genome screening offers incredible promise, it is not without challenges:</p><ol>
<li>
<p><strong>Accuracy and Interpretation</strong>: Genetic predisposition does not guarantee disease. Misinterpretation of results can lead to unnecessary anxiety or unwarranted medical interventions.</p>
</li>
<li>
<p><strong>Privacy and Data Security</strong>: Genetic data is highly sensitive. Ensuring robust data protection measures is crucial to prevent misuse.</p>
</li>
<li>
<p><strong>Accessibility and Equity</strong>: High costs and limited availability may restrict access to genome screening, exacerbating health disparities.</p>
</li>
</ol><h3>Balancing Science and Pseudoscience</h3><p>The comparison of genome screening to horoscopes isn&rsquo;t entirely unfounded. Both offer predictive insights, but the scientific foundation of genome screening distinguishes it from astrology. Unlike the alignment of celestial bodies, genetic predictions are based on rigorous data and evidence. However, the probabilistic nature of genetic predispositions underscores the importance of interpreting results in conjunction with clinical and lifestyle factors.</p><h3>The Road Ahead</h3><p>As genome screening becomes more affordable and integrated into routine healthcare, its potential to transform lives is immense. Policymakers, healthcare providers, and genetic counselors must collaborate to ensure ethical implementation, public awareness, and equitable access.</p><p>Imagine a future where your genetic "horoscope" is a trusted guide, not just a prediction. Early genome screening could help chart a healthier path for generations, making it a cornerstone of personalized medicine. After all, our genes might just hold the key to unlocking a future of better health and well-being.</p><p>&nbsp;</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long reads]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p>
<p>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</guid>
	<pubDate>Thu, 24 May 2018 10:06:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</link>
	<title><![CDATA[pbalign: maps PacBio reads to reference sequences and saves alignments to a BAM file]]></title>
	<description><![CDATA[pbalign aligns PacBio reads to reference sequences, filters aligned reads according to user-specific filtering criteria, and converts the output to either the SAM format or PacBio Compare HDF5 (e.g., .cmp.h5) format. The output Compare HDF5 file will be compatible with Quiver if --forQuiver option is specified.<p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/pbalign" rel="nofollow">https://github.com/PacificBiosciences/pbalign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</guid>
	<pubDate>Mon, 11 Jun 2018 05:14:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</link>
	<title><![CDATA[npScarf: real-time scaffolder using SPAdes contigs and Nanopore sequencing reads]]></title>
	<description><![CDATA[npScarf (jsa.np.npscarf) is a program that connect contigs from a draft genomes to generate sequences that are closer to finish. These pipelines can run on a single laptop for microbial datasets. In real-time mode, it can be integrated with simple structural analyses such as gene ordering, plasmid forming.<p>Address of the bookmark: <a href="http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html" rel="nofollow">http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>