<?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/29912?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/29912?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</guid>
	<pubDate>Tue, 13 Dec 2016 10:23:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</link>
	<title><![CDATA[ScaffMatch]]></title>
	<description><![CDATA[<p>caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).</p>
<p>The arguments accepted by ScaffMatch are:</p>
<p>&nbsp; -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;</p>
<p>&nbsp; -c) Contig fasta file;</p>
<p>&nbsp; -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;</p>
<p>&nbsp; -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;</p>
<p>&nbsp; -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;</p>
<p>&nbsp; -i) (Comma separated list of) insert size(s) of the library(-ies);</p>
<p>&nbsp; -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);</p>
<p>&nbsp; -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;</p>
<p>&nbsp; -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;</p>
<p>&nbsp; -l) Log file - where to store the logs. Optional argument. By default, stdout is used.</p><p>Address of the bookmark: <a href="http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch" rel="nofollow">http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</guid>
	<pubDate>Mon, 19 Dec 2016 14:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</link>
	<title><![CDATA[pyScaf]]></title>
	<description><![CDATA[<p>pyScaf orders contigs from genome assemblies utilising several types of information:</p>
<ul>
<li>paired-end (PE) and/or mate-pair libraries (<a href="https://github.com/lpryszcz/pyScaf#ngs-based-scaffolding">NGS-based mode</a>)</li>
<li>long reads (<a href="https://github.com/lpryszcz/pyScaf#scaffolding-based-on-long-reads">NGS-based mode</a>)</li>
<li>synteny to the genome of some related species (<a href="https://github.com/lpryszcz/pyScaf#reference-based-scaffolding">reference-based mode</a>)</li>
</ul>
<p>Scaffolding&nbsp;</p>
<p>In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.</p>
<p>Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:</p>
<ul>
<li>matches not satisfying cut-offs (<code>--identity</code>&nbsp;and&nbsp;<code>--overlap</code>)</li>
<li>suboptimal matches (only best match of each query to reference is kept)</li>
<li>and removing overlapping matches on reference.</li>
</ul>
<p>In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on&nbsp;<em>C. parapsilosis</em>&nbsp;(13 Mb; CANPA) and&nbsp;<em>A. thaliana</em>&nbsp;(119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (<a href="https://www.dropbox.com/sh/bb7lwggo40xrwtc/AAAZ7pByVQQQ-WhUXZVeJaZVa/pyScaf?dl=0">Figures in dropbox</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=2036953672">CANPA table</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=1920757821">ARATH table</a>).<br>Runs took ~0.5 min for CANPA on&nbsp;<code>4 CPUs</code>&nbsp;and ~2 min for ARATH on&nbsp;<code>16 CPUs</code>.</p>
<p><span>Important remarks:</span></p>
<ul>
<li>Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.</li>
<li>pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no&nbsp;<em>de novo assembler</em>&nbsp;/ scaffolder is perfect...), which breaks synteny.</li>
<li>pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.</li>
<li>pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations.&nbsp;<span>Note however, this is experimental implementation!</span></li>
<li>Consider closing gaps after scaffolding.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/lpryszcz/pyScaf" rel="nofollow">https://github.com/lpryszcz/pyScaf</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</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/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44705/pirna-and-bioinformatics-decoding-the-guardians-of-the-genome</guid>
	<pubDate>Sat, 07 Dec 2024 02:15:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44705/pirna-and-bioinformatics-decoding-the-guardians-of-the-genome</link>
	<title><![CDATA[piRNA and Bioinformatics: Decoding the Guardians of the Genome]]></title>
	<description><![CDATA[<p>In the symphony of small RNAs, PIWI-interacting RNAs (piRNAs) stand out as the protectors of genomic integrity. These small, non-coding RNAs play critical roles in silencing transposable elements, regulating gene expression, and maintaining germline stability. The rise of bioinformatics has revolutionized our understanding of piRNAs, enabling researchers to decipher their biogenesis, functions, and evolutionary significance.</p><h3>What Are piRNAs?</h3><p>piRNAs are the largest class of small non-coding RNAs, typically 24&ndash;32 nucleotides in length. Unlike microRNAs (miRNAs) and small interfering RNAs (siRNAs), piRNAs do not rely on Dicer enzymes for maturation. Instead, they are processed from long single-stranded precursors and associate with PIWI proteins, a subclass of the Argonaute protein family.</p><p>The primary functions of piRNAs include:</p><ol>
<li><strong>Silencing Transposable Elements</strong>: By targeting transposons, piRNAs prevent genomic instability, particularly in germline cells.</li>
<li><strong>Regulating Gene Expression</strong>: piRNAs modulate gene expression at transcriptional and post-transcriptional levels.</li>
<li><strong>Epigenetic Modulation</strong>: They guide epigenetic modifications, such as DNA methylation, to specific genomic loci.</li>
</ol><h3>Challenges in piRNA Research</h3><p>Studying piRNAs is fraught with challenges, including:</p><ul>
<li><strong>Short Length</strong>: Their small size complicates sequencing and alignment.</li>
<li><strong>Lack of Sequence Conservation</strong>: Unlike miRNAs, piRNAs exhibit limited sequence conservation across species.</li>
<li><strong>Complex Biogenesis</strong>: The intricate pathways of piRNA generation require sophisticated computational tools to unravel.</li>
</ul><h3>Bioinformatics: Illuminating the World of piRNAs</h3><p>Bioinformatics has emerged as an indispensable tool for studying piRNAs, facilitating their discovery, annotation, and functional analysis. Here's how bioinformatics is transforming piRNA research:</p><h4>1. <strong>Identification and Annotation</strong></h4><p>The discovery of piRNAs relies on next-generation sequencing (NGS) data. Bioinformatics tools such as <em>piRNApredictor</em> and <em>Piano</em> identify piRNA clusters and predict potential targets. Databases like piRBase and piRNAdb curate information about known piRNAs, their sequences, and associated proteins.</p><h4>2. <strong>Mapping and Alignment</strong></h4><p>piRNAs often originate from repetitive regions, making their alignment challenging. Tools like Bowtie and STAR handle the unique mapping requirements of piRNAs, enabling accurate identification of piRNA clusters in genomes.</p><h4>3. <strong>Functional Analysis</strong></h4><p>Bioinformatics approaches predict piRNA functions by analyzing their interactions with transposons, genes, and epigenetic marks. Algorithms such as TargetFinder and RIblast explore piRNA-mRNA interactions, shedding light on regulatory networks.</p><h4>4. <strong>Evolutionary Studies</strong></h4><p>piRNAs are evolutionarily diverse, reflecting their roles in species-specific genomic defense. Comparative genomics tools help trace the evolution of piRNA clusters and their associated PIWI proteins across species.</p><h4>5. <strong>Epigenomic Insights</strong></h4><p>piRNAs are key players in epigenetic regulation. Bioinformatics pipelines integrate piRNA data with chromatin immunoprecipitation sequencing (ChIP-seq) and DNA methylation data to uncover their role in shaping the epigenome.</p><h3>Case Study: piRNAs in Germline Integrity</h3><p>One of the hallmark functions of piRNAs is the suppression of transposable elements in the germline. For example, in <em>Drosophila melanogaster</em>, piRNAs target retrotransposons like <em>gypsy</em> and <em>copia</em>. Bioinformatics analyses revealed that these piRNAs guide PIWI proteins to transposon-derived RNA, ensuring genome stability during gametogenesis.</p><h3>Clinical Relevance of piRNAs</h3><p>Recent studies suggest that piRNAs may serve as biomarkers for diseases such as cancer, infertility, and neurodegenerative disorders. For instance:</p><ul>
<li><strong>Cancer</strong>: Dysregulated piRNA expression has been linked to tumorigenesis, making them potential targets for cancer therapies.</li>
<li><strong>Infertility</strong>: Aberrant piRNA pathways are implicated in male infertility due to their role in spermatogenesis.</li>
<li><strong>Neurodegeneration</strong>: piRNAs may regulate neuronal gene expression, highlighting their potential in neurological research.</li>
</ul><h3>Future Directions</h3><p>The integration of bioinformatics with emerging technologies offers exciting opportunities for piRNA research:</p><ul>
<li><strong>Single-Cell Sequencing</strong>: Unveiling cell-specific piRNA expression and function.</li>
<li><strong>Machine Learning</strong>: Predicting piRNA functions and targets with greater accuracy.</li>
<li><strong>CRISPR-Based Tools</strong>: Editing piRNA clusters to explore their roles in vivo.</li>
</ul><h3>Conclusion</h3><p>piRNAs are the unsung guardians of the genome, safeguarding genetic material from transposable elements and contributing to gene regulation and epigenetic programming. Bioinformatics has opened the floodgates of discovery, unraveling the complexities of piRNAs and their myriad roles in biology and disease.</p><p>As we continue to decode the piRNA landscape, these small RNAs promise to unveil big secrets about genome stability, evolution, and human health, cementing their place as a fascinating frontier in molecular biology.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>