<?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/38755?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/38755?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40546/clincnv-detection-of-copy-number-changes-in-germlinetriosomatic-contexts-in-ngs-data</guid>
	<pubDate>Thu, 16 Jan 2020 23:16:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40546/clincnv-detection-of-copy-number-changes-in-germlinetriosomatic-contexts-in-ngs-data</link>
	<title><![CDATA[ClinCNV: Detection of copy number changes in Germline/Trio/Somatic contexts in NGS data]]></title>
	<description><![CDATA[<p><span>ClinCNV detects CNVs in germline and somatic context in NGS data (targeted and whole-genome). We work in cohorts, so it makes sense to try&nbsp;</span><code>ClinCNV</code><span>&nbsp;if you have more than 10 samples (recommended amount - 40 since we estimate variances from the data). By "cohort" we mean samples sequenced with the same enrichment kit with approximately the same depth (ie 1x WGS and 30x WGS better be analysed in separate runs of ClinCNV). Of course it is better if your samples were sequenced within the same sequencing facility.</span></p><p>Address of the bookmark: <a href="https://github.com/imgag/ClinCNV" rel="nofollow">https://github.com/imgag/ClinCNV</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</guid>
	<pubDate>Mon, 09 Nov 2020 02:56:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</link>
	<title><![CDATA[Platypus – R package for object detection and image segmentation.]]></title>
	<description><![CDATA[<p><a href="https://github.com/maju116/platypus" target="_blank">platypus</a>&nbsp;is an R package for object detection and semantic segmentation. Currently using&nbsp;</p>
<div>platypus&nbsp;you can perform:</div>
<ul>
<li>multi-class semantic segmentation using&nbsp;U-Net&nbsp;architecture</li>
<li>multi-class object detection using&nbsp;YOLOv3&nbsp;architecture</li>
</ul>
<p>You can install the latest version of&nbsp;platypus&nbsp;with&nbsp;remotes&nbsp;package:</p>
<div>
<div>
<div>
<div>remotes::install_github("maju116/platypus")</div>
</div>
</div>
</div>
<p>Note that in order to install&nbsp;platypus&nbsp;you need to install&nbsp;keras&nbsp;and&nbsp;tensorflow&nbsp;packages and&nbsp;Tensorflow&nbsp;version&nbsp;&gt;= 2.0.0&nbsp;(&nbsp;Tensorflow 1.x&nbsp;will not be supported!)</p><p>Address of the bookmark: <a href="https://github.com/maju116/platypus" rel="nofollow">https://github.com/maju116/platypus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</guid>
	<pubDate>Sat, 05 Sep 2026 01:04:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</link>
	<title><![CDATA[The Hidden Pages of Our DNA]]></title>
	<description><![CDATA[<p>Imagine opening the instruction manual for life.</p><p>It is enormous, billions of letters long. Some of those letters are easy to understand because they contain instructions for building proteins, the tiny machines that keep our cells alive.</p><p>But what if some of the most important instructions aren't in those obvious chapters?</p><p>Scientists have long suspected that the mysterious stretches of DNA between protein-coding genes may contain some of life's most interesting secrets. These regions can act like switches, telling genes when, where, and how strongly to turn on. Among them are conserved non-coding elements, or CNEs DNA sequences that have remained remarkably similar across different species.</p><p>Think of a CNE as a sentence that nature has copied into several editions of the same book.</p><p>A mouse has it.</p><p>A bird has it.</p><p>A human has it.</p><p>And despite millions of years of evolution, much of the sentence remains almost unchanged.</p><p>That conservation is a clue: this piece of DNA probably matters.</p><p>But there was a problem. Finding these hidden sentences across enormous genomes is difficult. Researchers needed to compare many genomes, identify conserved regions, and then determine which of those regions might have evolved unusually quickly in particular branches of the evolutionary tree.</p><p>Enter CNEwrap.&nbsp;https://github.com/YanCCscu/CNEwrap</p><p>The researchers developed CNEwrap as a streamlined toolkit capable of handling large-scale genome comparisons, conserved-element detection, and evolutionary analysis. Inside it is a new algorithm called EvoAcc, designed to identify CNEs that show accelerated evolution in specific species or lineages.</p><p>Why does that matter?</p><p>Because evolution isn't just about what stays the same.</p><p>Sometimes, the most interesting story is hidden in what changed.</p><p>Imagine that nearly every species carries the same regulatory sentence, but one lineage suddenly has several unusual edits. Perhaps those changes helped shape a new body structure, a different adaptation, or another distinctive trait.</p><p>EvoAcc is designed to help researchers find these evolutionary clues. In the study's tests, it performed particularly well in scenarios involving two or three accelerated lineages and showed improved sensitivity to insertion and deletion mutations compared with several existing approaches.</p><p>The researchers also tested CNEwrap using functional genomic regions from mammals and found that EvoAcc could recover human-specific accelerated regions while identifying some signals that other methods missed.</p><p>So the story of CNEwrap is really a story about looking beyond the obvious.</p><p>For decades, scientists have often focused on the DNA that directly encodes proteins. But the genome is more like a vast library: the protein-coding genes are the main text, while non-coding regions may contain punctuation, instructions, switches, annotations, and editing notes that tell the cell how to read the book.</p><p>CNEwrap gives researchers a new way to search that hidden material.</p><p>And perhaps somewhere inside those billions of DNA letters is an evolutionary story we haven't read yet.</p><p>The exciting part is that we now have better tools to find it.</p><p>Read more about it&nbsp;https://academic.oup.com/nar/article/54/14/gkag709/8738333?</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37794/mimicree2-genome-wide-forward-simulations-of-evolve-and-resequencing-studies</guid>
	<pubDate>Fri, 28 Sep 2018 09:21:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37794/mimicree2-genome-wide-forward-simulations-of-evolve-and-resequencing-studies</link>
	<title><![CDATA[MimicrEE2: Genome-wide forward simulations of Evolve and Resequencing studies]]></title>
	<description><![CDATA[<p><span>MimicrEE2, a multi-threaded Java program for genome-wide forward simulations of evolving populations. MimicrEE2 enables the convenient usage of available genomic resources, supports biological particulars of model organism frequently used in E&amp;R studies and offers a wide range of different adaptive models (selective sweeps, polygenic adaptation, epistasis). MimicrEE2 runs on any computer with Java installed. It is distributed under the GPLv3 license at&nbsp;</span><a href="https://sourceforge.net/projects/mimicree2/">https://sourceforge.net/projects/mimicree2/</a><span>.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/mimicree2/" rel="nofollow">https://sourceforge.net/projects/mimicree2/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</guid>
	<pubDate>Tue, 16 Mar 2021 05:45:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</link>
	<title><![CDATA[Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation]]></title>
	<description><![CDATA[<p><span>We demonstrate a novel approach for</span><span>local alignment of DNA reads with respect to reference genome.</span><span>For this process we have used Skip-gram model for creating</span><span>encoding(Nucl2Vec) and k-nearest neighbor for the alignment.</span><span>With our new approach we have reduced computation cost for</span><span>local alignment , while achieving accuracy comparable to existing</span><span>defacto standard BWA-MEM tool.</span> </p>
<p><em>https://prakharg24.github.io/papers/401851.full.pdf</em></p><p>Address of the bookmark: <a href="https://prakharg24.github.io/papers/401851.full.pdf" rel="nofollow">https://prakharg24.github.io/papers/401851.full.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</guid>
	<pubDate>Fri, 26 Jul 2024 06:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</link>
	<title><![CDATA[Basics of BLAST Programs !]]></title>
	<description><![CDATA[<p>The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.</p><p>Key Features of BLAST:<br />1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.</p><p>2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.</p><p>3. Versatility: There are several versions of BLAST for different types of sequence comparisons:<br /> - blastn: Compares a nucleotide query sequence against a nucleotide sequence database.<br /> - blastp: Compares a protein query sequence against a protein sequence database.<br /> - blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.<br /> - tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.<br /> - tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.</p><p>4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.</p><p>5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.</p><p>Applications of BLAST:<br />- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.<br />- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.<br />- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.<br />- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.</p><p>Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</guid>
	<pubDate>Wed, 29 Aug 2018 16:00:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</link>
	<title><![CDATA[STELLAR: fast and exact local alignments]]></title>
	<description><![CDATA[<p><span>STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at&nbsp;</span><span><a href="http://www.seqan.de/projects/stellar"><span>http://www.seqan.de/projects/stellar</span></a></span><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.seqan.de/apps/stellar/" rel="nofollow">http://www.seqan.de/apps/stellar/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Sun, 20 Jan 2019 06:34:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</link>
	<title><![CDATA[ClipCrop: a tool for detecting structural variations with single-base resolution using soft-clipping information]]></title>
	<description><![CDATA[<p><span>ClipCrop for detecting SVs with single-base resolution using soft-clipping information. A soft-clipped sequence is an unmatched fragment in a partially mapped read. To assess the performance of ClipCrop with other SV-detecting tools, we generated various patterns of simulation data &ndash; SV lengths, read lengths, and the depth of coverage of short reads &ndash; with insertions, deletions, tandem duplications, inversions and single nucleotide alterations in a human chromosome.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/shinout/clipcrop" rel="nofollow">https://github.com/shinout/clipcrop</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42354/vsfilt-a-tool-to-improve-virtual-screening-by-structural-filtration-of-docking-poses</guid>
	<pubDate>Wed, 25 Nov 2020 02:39:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42354/vsfilt-a-tool-to-improve-virtual-screening-by-structural-filtration-of-docking-poses</link>
	<title><![CDATA[vsFilt: A tool to improve virtual screening by structural filtration of docking poses]]></title>
	<description><![CDATA[<p><span>The vsFilt is the first open application for post-docking structural filtration, available as a web-server. The new tool is easy to use and configure to detect a wide range of interaction types that are known to be involved in molecular recognition, including hydrogen and halogen bonds, ionic interactions, hydrophobic contacts, &pi;-stacking, and cation-&pi; interactions. The web-server can process large libraries of up to 150&rsquo;000 docked ligand poses. The results are web-based and can be operated on-line using the built-in HTML5 interactive analysis tools, or can be downloaded for a local use. The vsFilt is freely available on-line, no login required.</span></p><p>Address of the bookmark: <a href="https://biokinet.belozersky.msu.ru/vsfilt" rel="nofollow">https://biokinet.belozersky.msu.ru/vsfilt</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>