<?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/38649?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/38649?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</guid>
	<pubDate>Fri, 04 Jan 2019 10:10:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</link>
	<title><![CDATA[EXCAVATOR: detecting copy number variants from whole-exome sequencing data]]></title>
	<description><![CDATA[<p><span>EXCAVATOR, for the detection of copy number variants (CNVs) from whole-exome sequencing data. EXCAVATOR combines a three-step normalization procedure with a novel heterogeneous hidden Markov model algorithm and a calling method that classifies genomic regions into five copy number states. We validate EXCAVATOR on three datasets and compare the results with three other methods. These analyses show that EXCAVATOR outperforms the other methods and is therefore a valuable tool for the investigation of CNVs in largescale projects, as well as in clinical research and diagnostics. EXCAVATOR is freely available at&nbsp;</span><span><a href="http://sourceforge.net/projects/excavatortool/" target="_blank"><span>http://sourceforge.net/projects/excavatortool/</span></a></span><span>.</span><br><br><br><span>EXCAVATOR is a novel software package for the detection of copy number variants (CNVs) from whole-exome sequencing data.</span><br><span>EXCAVATOR has been published on Genome Biology (</span><a href="http://genomebiology.com/2013/14/10/R120/abstract" target="_blank">http://genomebiology.com/2013/14/10/R120/abstract<span></span></a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/excavatortool/" rel="nofollow">https://sourceforge.net/projects/excavatortool/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/39827/prof-dr-med-andreas-ramming</guid>
  <pubDate>Wed, 07 Aug 2019 03:25:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Prof. Dr. med. Andreas Ramming]]></title>
  <description><![CDATA[
<p>In many autoimmune diseases, a misdirected immune response leads to chronic inflammation and subsequently to fibrotic and degenerative tissue remodeling. Therapeutic options are available for inflammatory joint diseases, but only about 40% of patients respond to these existing therapies on a permanent basis. In the remaining cases, these therapies miss their target from the beginning or later during the course of treatment failure. There are currently no causal therapies available for the treatment of fibrotic autoimmune diseases such as systemic sclerosis. Therefore, there is an urgent need to develop new therapeutic options for the treatment of fibrotic and synovitic autoimmune diseases. His group is therefore deal with the molecular mechanisms of these misdirected signaling pathways for the development of novel, targeted therapies</p>

<p>http://www.medizin3.uk-erlangen.de/forschung/arbeitsgruppen/matrixbiologie-entzuendliche-signalwege-in-arthritis-und-fibrose/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</guid>
	<pubDate>Sun, 16 Feb 2020 08:47:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</link>
	<title><![CDATA[iSeqQC: a tool for expression-based quality control in RNA sequencing]]></title>
	<description><![CDATA[<p><span>iSeqQC, an expression-based QC tool that detects outliers either produced due to variable laboratory conditions or due to dissimilarity within a phenotypic group. iSeqQC implements various statistical approaches including unsupervised clustering, agglomerative hierarchical clustering and correlation coefficients to provide insight into outliers.</span></p>
<p><a href="http://cancerwebpa.jefferson.edu/iSeqQC/">http://cancerwebpa.jefferson.edu/iSeqQC/</a></p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8</a></p><p>Address of the bookmark: <a href="https://github.com/gkumar09/iSeqQC" rel="nofollow">https://github.com/gkumar09/iSeqQC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</guid>
	<pubDate>Sat, 26 Dec 2020 08:35:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</link>
	<title><![CDATA[FastProNGS: fast preprocessing of next-generation sequencing reads]]></title>
	<description><![CDATA[<p><span>FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/Megagenomics/FastProNGS" rel="nofollow">https://github.com/Megagenomics/FastProNGS</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44672/libraries-or-management-tools-for-high-throughput-sequencing-data</guid>
	<pubDate>Fri, 04 Oct 2024 02:45:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44672/libraries-or-management-tools-for-high-throughput-sequencing-data</link>
	<title><![CDATA[Libraries or management tools for high throughput sequencing data]]></title>
	<description><![CDATA[<ul>
<li><a href="http://gatb.inria.fr/"><span>GATB</span></a>&nbsp;Library.&nbsp;The&nbsp;<span>Genome Analysis Toolbox with de-Bruijn graph.&nbsp;</span>A large part of tools developed by the GenScale team are based on this library.<br />These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em>&nbsp;metagenomes). Among them are (the full is available here:&nbsp;<a href="https://gatb.inria.fr/software/">https://gatb.inria.fr/software/</a>):</li>
<li><a href="https://github.com/morispi/LRez"><span>LRez</span></a>: C++ Library and toolkit for the barcode-based management and indexation of linked-read datasets.</li>
</ul><h2>Variant calling and/or genotyping</h2><ul>
<li><a href="https://gatb.inria.fr/software/discosnp/" title="DiscoSNP">DiscoSNP++ and&nbsp;discoSnpRAD</a>: Reference-free small variant discovery (SNPs and indels)</li>
<li><a href="https://gatb.inria.fr/software/mind-the-gap/" title="MindTheGap">MindTheGap</a>: Detection and assembly of large insertion variants</li>
<li><a href="https://gatb.inria.fr/software/takeabreak/" title="TakeABreak">TakeABreak</a>:&nbsp;reference-free inversion discovery tool</li>
<li><a href="https://github.com/llecompte/SVJedi">SVJedi</a>: Structural Variant genotyper with long read data</li>
<li><a href="https://github.com/SandraLouise/SVJedi-graph">SVJedi-graph</a>: Structural Variant genotyper with long read data using a variation graph</li>
</ul><h2>Sequence assembly</h2><ul>
<li><a href="https://github.com/cguyomar/MinYS">MinYS</a>: reference-guided genome assembly in metagenomics data</li>
<li><a href="https://github.com/anne-gcd/MTG-Link">MTG-link</a>: local assembly tool for linked-read data</li>
<li><a href="https://gatb.inria.fr/software/minia/" title="Minia">Minia</a>: De novo short read assembler</li>
<li><a href="https://gatb.inria.fr/de-novo-genome-assembly/">de-novo pipeline</a>:&nbsp;<em>de-novo</em>&nbsp;assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes</li>
<li><a href="https://gatb.inria.fr/software/mapsembler/" title="Mapsembler2">Mapsembler2</a>: Targeted assembly (not maintained)</li>
</ul><h2>Managing k-mers &amp; indexation</h2><ul>
<li><a href="https://github.com/lrobidou/findere">findere</a>:&nbsp;simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
<ul>
<li><a href="https://github.com/lrobidou/fimpera">fimpera</a>&nbsp;extends findere adding the abundance information.</li>
</ul>
</li>
<li><a href="https://github.com/tlemane/kmtricks">kmtricks</a>:&nbsp;modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.</li>
<li><a href="https://github.com/tlemane/kmindex">kmindex&nbsp;</a>is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.</li>
<li><a href="https://github.com/pierrepeterlongo/back_to_sequences">back to sequences</a>: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.</li>
<li><a href="https://github.com/vicLeva/bqf">Backpack Quotient Filter</a>:&nbsp;k-mer indexing data structure with abundance</li>
<li><a href="http://github.com/GATB/rconnector">short read connector</a>:&nbsp;Detect similar reads from potentially large read set</li>
<li><a href="https://gatb.inria.fr/software/dsk/" title="DSK">DSK</a>:&nbsp;Count K-mer in sequences</li>
</ul><h2>Pangenome graph manipulation</h2><ul>
<li><a href="https://github.com/Tharos-ux/pancat">Pancat</a>: Pangenome Comparison and Analysis Toolkit</li>
<li><a href="https://pypi.org/project/gfagraphs/">GFAGraphs</a>: a Python library to handle pangenome graph files in GFA format.</li>
</ul><h2>Comparative metagenomics with k-mers</h2><ul>
<li><a href="https://github.com/GATB/simka">Simka and SimkaMin</a>:&nbsp;Comparative metagenomics for large-scale datasets</li>
<li><a href="https://team.inria.fr/genscale/high-throughput-sequence-analysis/compreads-metagenomic-data-analysis/">Comparead &amp; Commet</a>:&nbsp;comparison of metagenomic datasets</li>
</ul><h2>Species and bacterial strains identification</h2><ul>
<li><a href="https://github.com/gsiekaniec/ORI">ORI</a>: software using long nanopore reads to identify bacteria present in a sample at the strain level</li>
<li><a href="https://github.com/kevsilva/StrainFLAIR">StrainFLAIR</a>:&nbsp;STRAIN-level proFiLing using vArIation gRaph</li>
</ul><h2>General-purpose sequencing data manipulation</h2><ul>
<li><a href="https://team.inria.fr/genscale/ngs-software/gassst/">GASSST</a>:&nbsp;long read mapper</li>
<li><a href="https://gatb.inria.fr/software/leon/" title="Leon">Leon</a>: short read compressor (now included in GATB-core)</li>
<li><a href="https://gatb.inria.fr/software/bloocoo/" title="Bloocoo">Bloocoo</a>:&nbsp;short read corrector</li>
<li><a href="https://github.com/GATB/bcalm">BCALM</a>:&nbsp;Construct compacted de Bruijn graphs (unitigs)</li>
</ul><h2>&nbsp;Protein Structure</h2><ul>
<li><a href="https://team.inria.fr/genscale/protein-structure/a-purva-contact-map-overlap-solver/">A_Purva</a>:&nbsp;Contact Map Overlap solver</li>
<li><a href="https://team.inria.fr/genscale/protein-structure/md-jeep-distance-geomtry-solver/">MD-Jeep</a>:&nbsp;Distance Geometry solver</li>
<li><a href="https://team.inria.fr/genscale/csa-comparative-structural-alignment/">CSA</a>:&nbsp;Comparative Structural Alignment</li>
</ul><h2>Workflow</h2><ul>
<li><a href="https://team.inria.fr/genscale/workflows/slicee/">SLICEE</a>:&nbsp;parallel execution of bioinformatics workflows</li>
</ul><h3>Comparative Genomics</h3><ul>
<li><a href="https://team.inria.fr/genscale/comparative-genomics/cassis/">CASSIS</a>:&nbsp;detection of rearrangement breakpoints</li>
<li><a href="https://team.inria.fr/genscale/high-throughput-sequence-analysis/plast-intensive-sequence-comparison/">PLAST</a>:&nbsp;intensive bank-to-bank sequence comparison</li>
<li><a href="https://github.com/stephanierobin/DrjBreakpointFinder">DRJBreakpointFinder</a>: detection and precise localization of excision sites in proviral segments</li>
</ul>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44555/ultra-ultra-locates-tandemly-repetitive-areas-effective-labeling-of-repetitive-genomic-sequence</guid>
	<pubDate>Sat, 08 Jun 2024 16:03:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44555/ultra-ultra-locates-tandemly-repetitive-areas-effective-labeling-of-repetitive-genomic-sequence</link>
	<title><![CDATA[ULTRA (ULTRA Locates Tandemly Repetitive Areas) : Effective Labeling of Repetitive Genomic Sequence]]></title>
	<description><![CDATA[<p dir="auto">ULTRA is a tool to find and annotate tandem repeats inside genomic sequence. It is able to find repeats of any length and of any period (up to a maximum period of 4000). It can find highly decayed repeats missed by other software, and it will also be able to find very large repeats in highly repetitive sequence, regardless of the size of sequence or length of repeats. ULTRA offers meaningful annotation scores and can produce annotation P-values at user request.</p>
<p dir="auto">More at&nbsp;https://www.biorxiv.org/content/10.1101/2024.06.03.597269v1</p><p>Address of the bookmark: <a href="https://github.com/TravisWheelerLab/ULTRA" rel="nofollow">https://github.com/TravisWheelerLab/ULTRA</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19695/china-university-of-macau-phd-position-2015-in-bioinformatics-computer-science</guid>
  <pubDate>Mon, 22 Dec 2014 00:12:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[China University of Macau PhD Position 2015 in Bioinformatics, Computer Science]]></title>
  <description><![CDATA[
<p>The Computational Biology and Bioinformatics Group at the University of Macau is inviting applications for PhD Position. Applicants will work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems. The duration of this PhD position is 2-3 years, starting in August 2015. Remuneration paid to candidate is MOP 11000-14000/month (~USD 1375-1750/month). The applications should be submitted before March 2015.</p>

<p>Study Subject(s): PhD position is award in the field of Bioinformatics/Computer Science.<br />Course Level: Position is available for pursuing PhD degree level at the University of Macau.<br />Scholarship Provider: University of Macau<br />Scholarship can be taken at: China</p>

<p>Eligibility: The ideal candidate would be a master degree holder in Bioinformatics or related disciplines with knowledge in Medical sciences or Life sciences (with GPA of at least 3.0 on a 4-point scale or equivalent) . Knowledge in programming (C and C++) and Linux scripting are necessary; experience in molecular docking, molecular dynamics simulations or molecular modeling is an advantage. The candidate should be fluent in spoken and written English; preference will be given to applicants with good publication records in relevant areas.</p>

<p>Scholarship Open for International Students: Researchers from China can apply for this PhD position.</p>

<p>Scholarship Description:</p>

<p>The Computational Biology and Bioinformatics Group at the University of Macau is looking for a motivated PhD student in Bioinformatics or Computer Science to work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems.</p>

<p>Number of award(s): There is only one PhD position available.</p>

<p>Duration of award(s): The duration of this PhD position is 2-3 years.</p>

<p>What does it cover? Remuneration paid to candidate is  MOP 11000-14000/month (~USD 1375-1750/month).</p>

<p>Selection Criteria: Not Known</p>

<p>Notification: Not Known</p>

<p>How to Apply: Send your current CV, your academic transcripts, a letter of motivation and research interests, two letters of recommendations from academic faculty to Dr. Shirley Siu at shirleysiu[at]umac.mo before March 2015.</p>

<p>Scholarship Application Deadline: The applications should be submitted before March 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43940/langya-virus-update</guid>
	<pubDate>Fri, 12 Aug 2022 05:31:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43940/langya-virus-update</link>
	<title><![CDATA[Langya Virus Update !]]></title>
	<description><![CDATA[<p>https://www.ncbi.nlm.nih.gov/nuccore/OM101125,OM101126,OM101127,OM101128,OM101129,OM101130?</p><p>Zoonotic Henipavirus</p><p>https://pubmed.ncbi.nlm.nih.gov/35921459/</p><p>https://www.ncbi.nlm.nih.gov/nuccore/OM069646,,OM069567,OM069568,OM069569,OM069570,OM069571,OM069572,OM069573,OM069574,OM069575,OM069576,OM069577,OM069578,OM069579,OM069580,OM069581,OM069582,OM069583,OM069584,OM069585,OM069586,OM069587,OM069588,OM069589,OM069590,OM069591,OM069592,OM069593,OM069594,OM069595,OM069596,OM069597,OM069598,OM069599,OM069600,OM069601,OM069602,OM069603,OM069604,OM069605,OM069606,OM069607,OM069608,OM069609,OM069610,OM069611,OM069612,OM069613,OM069614,OM069615,OM069616,OM069617,OM069618,OM069619,OM069620,OM069621,OM069622,OM069623,OM069624,OM069625,OM069626,OM069627,OM069628,OM069629,OM069630,OM069631,OM069632,OM069633,OM069634,OM069635,OM069636,OM069637,OM069638,OM069639,OM069640,OM069641,OM069642,OM069643,OM069644,OM069645,OM069646</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/861/fiona-brinkman-laboratory</guid>
  <pubDate>Sun, 14 Jul 2013 12:46:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Fiona Brinkman Laboratory]]></title>
  <description><![CDATA[
<p>Infectious disease control needs to be made more “sustainable”. We need to reduce selective pressure on pathogens to evolve antibiotic resistance. We need to control infectious disease outbreaks and associated immune disorders with a better understanding of the genetic,  environmental and social factors that impact disease spread and severity.</p>

<p>Research Area</p>

<p>Investigating the role in disease of both the microbe and its host (i.e immune system failure), using genomics and systems biology-based approaches<br />Using genomics and network analysis to characterize disease outbreaks and their environmental/social/genetic causes, and<br />Identifying new anti-infective and immune modulating therapies/biomarkers.</p>

<p>Link @ http://www.brinkman.mbb.sfu.ca/</p>
]]></description>
</item>

</channel>
</rss>