<?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/41501?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/41501?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</guid>
	<pubDate>Thu, 16 Dec 2021 02:50:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</link>
	<title><![CDATA[Peregrine &amp; SHIMMER Genome Assembly Toolkit]]></title>
	<description><![CDATA[<p><span>Peregrine is a fast genome assembler for accurate long reads (length &gt; 10kb, accuracy &gt; 99%). It can assemble a human genome from 30x reads within 20 cpu hours from reads to polished consensus. It uses Sparse HIereachical MimiMizER (SHIMMER) for fast read-to-read overlaping without quadratic comparisions used in other OLC assemblers.</span></p><p>Address of the bookmark: <a href="https://github.com/cschin/Peregrine" rel="nofollow">https://github.com/cschin/Peregrine</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</guid>
	<pubDate>Wed, 21 Feb 2024 12:37:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</link>
	<title><![CDATA[CLAW: Chloroplast Long-read Assembly Workflow]]></title>
	<description><![CDATA[<p dir="auto">CLAW (Chloroplast Long-read Assembly Workflow) is an mostly-automated Snakemake-based workflow for the assembly of chloroplast genomes. CLAW uses chloroplast long-reads, which are baited out of larger read libraries (e.g., an Oxford Nanopore Technologies MinION read library derived from photosynthetic tissue), for assembly with Flye and/or Unicycler. CLAW was designed with the novice bioinformatician in mind - it is easy to install and easy to use, requiring only minimal user input.</p><p>Address of the bookmark: <a href="https://github.com/aaronphillips7493/CLAW" rel="nofollow">https://github.com/aaronphillips7493/CLAW</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/30104/structural-variation-the-hidden-genomic-treasure</guid>
	<pubDate>Sat, 10 Dec 2016 16:19:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/30104/structural-variation-the-hidden-genomic-treasure</link>
	<title><![CDATA[Structural variation: the hidden genomic treasure]]></title>
	<description><![CDATA[<p>Genome re-sequencing projects have revealed substantial amounts of genetic variation between individuals extending beyond single nucleotide polymorphisms (SNPs) and short indels. Structural Variations (SVs) and Copy Number Variations (CNVs) are a major source of genomic variation. However, compared to SNPs, accurate detection, genotyping and understanding of CNVs is lagging behind due to much greater analytical challenges related to SV/CNV detection and analysis. In our lab we analyse SVs/CNVs using high-throughput sequencing and different analytical approaches.&nbsp;The most‐studied structural variants are copy number variations (CNVs) which can be generated by several different mechanisms including non‐allelic homologous recombination, non‐homologous end‐joining and deoxyribonucleic acid (DNA) replication‐related fork stalling and template switching. CNVs are closely related to segmental duplications (SDs): SDs can stimulate the formation of CNVs and themselves started out as CNVs, but became fixed in a species. Structural variation can be neutral but has also influenced our phenotypic evolution, for example our susceptibility to disease and our ability to digest certain types of food. Our understanding of the extent of structural variation is increasing rapidly, but it will be much more difficult to understand its phenotypic consequences.&nbsp;</p><p><img src="http://www.nature.com/nmeth/journal/v9/n2/images/nmeth.1858-F3.jpg" alt="image" width="946" height="603" style="border: 0px; border: 0px;"></p><p>Structural variants (SVs) such as deletions, insertions, duplications, inversions and translocations litter genomes and are often associated with gene expression changes and severe phenotypes (ie. genetic diseases in humans). Recent studies on the functional aspects of different types of SVs have unveiled several cases of adaptive evolution. For example, inversions have been associated with ecological adaptations and may facilitate speciation. Due to their prevalent nature, SVs arguably have a large impact on genome evolution and should not be neglected when studying the genetics of adaptation and speciation.&nbsp;SVs were classically defined as chromosomal rearrangements larger than 1kb, but due to a higher resolution of new detection methods, smaller variants (between 50 and 1000 base pairs) can now be accurately assessed. Besides various methods of detection in next generation sequencing data (paired end mapping, split reads, and depth of coverage), array-based approaches have proven to be particularly useful for detecting copy number variations (CNVs). These technologies have enabled researchers to catalog a wide spectrum of SVs in many organisms and infer the effects of selection shaping their evolutionary trajectories.</p><p><strong>Structure variation sequencing signature (Source: NatRev Genetics)</strong></p><p><img src="http://www.nature.com/nrg/journal/v12/n5/images/nrg2958-f2.jpg" alt="image" width="800" height="824" style="border: 0px; border: 0px;"></p><p>Related tools, databases and publications are listed below. If you know any interesing papers, please let us know in comment section:</p><p><br /><strong>Key concepts</strong></p><p>Structural variation includes balanced variants such as inversions and translocations, and unbalanced ones such as duplications and deletions (copy number variations or CNVs).</p><p>Structural variants can arise by several mechanisms, including nonallelic homologous recombination (NAHR), nonhomologous end‐joining (NHEJ) and DNA replication‐based fork stalling and template switching (FoSTeS).</p><p>CNV is closely linked to segmental duplication, but is not exactly the same. Segmental duplications can stimulate CNV formation by NAHR, and themselves arise from CNVs that have become fixed.</p><p>Segmental duplications did not appear uniformly during the evolution of the Great Ape species, but rather during a burst of activity around the time of the divergence of gorilla from the human/chimpanzee ancestor.</p><p>Duplicated genes play a critical role in the evolution of a genome as they act as &lsquo;spare parts&rsquo; than can evolve to perform new or more specialized functions.</p><p>Effects of structural variation on gene expression can be identified but only a few examples of the consequences for species biology have been documented.</p><p><strong style="font-size: 12.8px;">Tools</strong></p><p><a href="http://sv.gersteinlab.org/cnvnator">CNVnator</a>a tool for CNV discovery and genotyping from depth of read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21293372">2011a</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/21324876">2011b</a></p><p><a href="http://sv.gersteinlab.org/age">AGE</a>a tools that implements an algorithm for optimal alignment of sequences with SVs.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21233167">2011</a></p><p><a href="http://sv.gersteinlab.org/breakseq">BreakSeq</a>a pipeline for annotation, classification and analysis of SVs at single nucleotide resolution.<a href="http://www.ncbi.nlm.nih.gov/pubmed/20037582">2010</a></p><p><a href="http://sv.gersteinlab.org/pemer">PEMer</a>a computational and simulation framework for discovering SVs by paired-end read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/19236709">2009</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/17901297">2007</a></p><p>GASV https://code.google.com/archive/p/gasv/</p><p>PAIROSCOPE http://pairoscope.sourceforge.net/</p><p>SVDetect&nbsp;http://svdetect.sourceforge.net/Site/Home.html</p><p>BreakPtr, discovery of unbalanced structural variants (copy-number variants) with tiling microarrays&nbsp;<a href="http://tiling.mbb.yale.edu/BreakPtr/" target="_top">Link</a>&nbsp;</p><p>R Package&nbsp;https://www.bioconductor.org/help/course-materials/2010/EMBL2010/Practical-4-StructuralVariants.pdf<br /><br />BreakSeq, structural variant genotyping using split reads&nbsp;<a href="http://sv.gersteinlab.org/breakseq/" target="_top">Link</a>&nbsp;<br /><br />CopySeq, genotyping of unbalanced structural variants (copy-number variants) using read-depth&nbsp;<a href="http://www.korbel.embl.de/CopySeq/" target="_top">Link</a>&nbsp;<br /><br />DELLY2, integrated structural variant discovery, genotyping and visualization in deep sequencing data&nbsp;<a href="https://github.com/dellytools/delly" target="_top">Link</a>&nbsp;<br /><br />PEMer, structural variant discovery in 454 sequencing data by paired-end mapping&nbsp;<a href="http://www.korbel.embl.de/PEMer/" target="_top">Link</a>&nbsp;<br /><br />TIGER, transduction inference in germline genomes using short read data&nbsp;<a href="https://github.com/jelena-tica/TIGER" target="_top">Link</a>&nbsp;</p><p>MANTA&nbsp;https://github.com/Illumina/manta</p><p>SV-Bay&nbsp;https://github.com/InstitutCurie/SV-Bay</p><p>BreakDancer&nbsp;http://breakdancer.sourceforge.net/</p><p>Variation Hunter&nbsp;http://compbio.cs.sfu.ca/software-variation-hunter</p><p>Lumpy&nbsp;https://github.com/arq5x/lumpy-sv</p><p>ForestSV&nbsp;http://sebatlab.ucsd.edu/index.php/software-data&nbsp;</p><p>PBSuites for long reads&nbsp;https://sourceforge.net/projects/pb-jelly/</p><p><strong>Visualization</strong></p><p>The SV visualization tool:&nbsp;<a href="http://genomesavant.com/savant/">http://genomesavant.com/savant/</a></p><p>InGAP-SV (<a href="http://ingap.sourceforge.net/">http://ingap.sourceforge.net/</a>) that is nice tools for both detection and visualisation of severals kind of structural variations (Large insertions, translocation, deletion, inversions....)&nbsp;</p><p>Tools table: http://www.nature.com/nbt/journal/v29/n8/fig_tab/nbt.1904_T2.html</p><p>Variation Viewer https://www.ncbi.nlm.nih.gov/variation/view/</p><p><strong style="font-size: 12.8px;">Papers</strong></p><p>http://www.nature.com/nmeth/journal/v9/n2/full/nmeth.1858.html</p><p>http://journal.frontiersin.org/researchtopic/1412/structural-variations-in-genomes-ecological-and-evolutionary-implications</p><p>http://www.mi.fu-berlin.de/wiki/pub/ABI/GenomicsLecture10Materials/structural-variation.pdf</p><p>http://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-015-1479-3</p><p>https://www.ncbi.nlm.nih.gov/dbvar/content/overview/</p><p>http://www.nature.com/subjects/structural-variation</p><p>https://eichlerlab.gs.washington.edu/news/NatMeth_Feb2012.pdf</p><p>https://www.ncbi.nlm.nih.gov/pubmed/19477992 ***</p><p>https://www.ncbi.nlm.nih.gov/pubmed/22452995</p><p>http://biorxiv.org/content/early/2016/09/06/073833</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4479793/</p><p>http://www.nature.com/articles/srep18501</p><p>http://www.genetics.org/content/202/1/351</p><p>http://www.cs.cmu.edu/~sssykim/teaching/s13/slides/Lecture_SVI.pdf</p><p>https://www.omicsonline.org/open-access/structural-variation-detection-from-next-generation-sequencing-2469-9853-S1-007.php?aid=69055</p><p>http://schatzlab.cshl.edu/presentations/2016/2016.01.12.PAG.Structural%20Variations.pdf</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</guid>
	<pubDate>Fri, 26 Oct 2018 00:41:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</link>
	<title><![CDATA[COSINE: non-seeding method for mapping long noisy sequences]]></title>
	<description><![CDATA[<p><span>Third generation sequencing (TGS) are highly promising technologies but the long and noisy reads from TGS are difficult to align using existing algorithms. Here, we present COSINE, a conceptually new method designed specifically for aligning long reads contaminated by a high level of errors.</span></p><p>Address of the bookmark: <a href="https://github.com/SUwonglab/COSINE" rel="nofollow">https://github.com/SUwonglab/COSINE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</guid>
	<pubDate>Thu, 06 Sep 2018 16:27:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</link>
	<title><![CDATA[LSC: Improving PacBio Long Read Accuracy by Short Read Alignment]]></title>
	<description><![CDATA[<ul>
<li>Added Command line argument support.</li>
<li>Multi-stage execution modes.</li>
<li>Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.</li>
<li>Better compressed intermediate files.</li>
<li>Added utilities folder.</li>
<li>Added support for multiple short read files.</li>
<li>Removed use of configuration file.</li>
</ul><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</guid>
	<pubDate>Mon, 18 Dec 2017 04:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</link>
	<title><![CDATA[Run miniasm assembler on nanopore 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>Find the detail of the reads repeats:</p><blockquote><p>fq2fa ONT_A.fastq ONT_A.fasta&nbsp;<br /><br />minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X &gt; AONT.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT.paf &gt; AONTself.paf&nbsp;<br /><br />awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq &gt; invertedrepeat.list</p></blockquote><p>Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)</p><blockquote><p>minidot -f 5 -m 30000 AONTself.paf &gt; AONTself30000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself30000.eps &gt; AONTself30000final.eps&nbsp;<br /><br />minidot -f 5 -m 20000 AONTself.paf &gt; AONTself20000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself20000.eps &gt; AONTself20000final.eps&nbsp;<br /><br />minidot -f 5 -m 10000 AONTself.paf &gt; AONTself10000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself10000.eps &gt; AONTself10000final.eps&nbsp;</p></blockquote><p>Assemble with miniasm:</p><blockquote><p>miniasm -f ONT_A.fasta AONT.paf &gt; AONT.gfa&nbsp;</p><p>grep '^S' AONT.gfa |awk '{print "&gt;"$2"\n"$3}' &gt; AONT_miniasm.fasta&nbsp;<br /><br />minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X &gt; AONT_miniasm.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT_miniasm.paf &gt; AONT_miniasm_self.paf&nbsp;<br /><br />minidot -f 5 -m 10000 AONT_miniasm_self.paf &gt; AONT_miniasm_self10000.eps&nbsp;</p></blockquote><p>Njoy the assembly !</p>]]></description>
	<dc:creator>Jit</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>

</channel>
</rss>