<?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/38752?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/38752?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41144/seqmule-automated-human-exomegenome-variants-detection</guid>
	<pubDate>Tue, 18 Feb 2020 03:22:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41144/seqmule-automated-human-exomegenome-variants-detection</link>
	<title><![CDATA[SeqMule: Automated human exome/genome variants detection]]></title>
	<description><![CDATA[<p>SeqMule takes single-end or paird-end FASTQ or BAM files, generates a script consisting of more than 10 popular alignment, analysis tools and runs the script line by line. Users can change the pipeline or fine-tune the parameters by modifying its configuration file.</p><p>Address of the bookmark: <a href="https://doc-openbio.readthedocs.io/projects/seqmule/en/latest/" rel="nofollow">https://doc-openbio.readthedocs.io/projects/seqmule/en/latest/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</guid>
	<pubDate>Tue, 28 Jan 2020 03:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</link>
	<title><![CDATA[Π-cyc: A Reference-free SNP Discovery Application using Parallel Graph Search]]></title>
	<description><![CDATA[<p>Reference free SNP search for comparative population genomics: multiple samples run simultanously. **experimental phase, compiles and runs with OpenMPI-1.8.8 with Intel Compiler only</p>
<p><span>Cycles enumeration (aka Bubbles) as part of de novo de bruijn graphs assembly using colours can be unpractical for large error prone genomes which makes the assembly process produce an excessive number of false positive cycles.&nbsp; Our solution is to search the graph in multicores shared memory parallel mode using graph decomposition then use filtering method to generate good quality SNPs.</span></p>
<p><a href="https://arxiv.org/abs/1809.06700">https://arxiv.org/abs/1809.06700</a></p>
<p><a href="https://github.com/redayounsi/2KP2P">https://github.com/redayounsi/2KP2P</a></p>
<blockquote>
<p>/2kp2omp/bin/main_2kp2_K63_C2 -i fastq_files.txt -o fungus_bub.fasta -r stat_fungus.txt -c cov_fungus_hash.txt -k 63 -h 20 -b 100 -g 600 -l 100 -f 16 -t 5.0 -x 1 -v 0 -p 1 -y 1 -u 1</p>
<p>&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="https://github.com/redayounsi/2KP2P" rel="nofollow">https://github.com/redayounsi/2KP2P</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</guid>
	<pubDate>Sun, 11 Aug 2013 19:31:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</link>
	<title><![CDATA[Webinar: Wednesday 21 August 2013 at Noon EDT]]></title>
	<description><![CDATA[<p>This webinar will describe the use of combinatorial pooling to reconstruct gene sequences within BACs. Recent work in barley has shown that this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.</p><p>http://www.extension.org/pages/67926/upcoming-webinar:-selective-sequencing-through-combinatorial-pooling#.UggsVuHyPqU</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10392/research-associate-ra-at-institute-of-advanced-study-in-science-and-technology</guid>
  <pubDate>Mon, 05 May 2014 08:44:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate (RA) at INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY]]></title>
  <description><![CDATA[
<p>INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY<br />(An Autonomous Institute under Department of Science and Technology, Govt. of India)<br />Paschim Boragaon, Garchuk, Guwahati-781035</p>

<p>Appointment Adv.No.2</p>

<p>Applications in plain paper are invited from Indian citizens for one/two position each of Research Associate, Traineeship and Studentship for BIF facility, Division of Life Sciences, IASST.</p>

<p>Applications with complete Bio-data containing contact address, e-mail and phone number, two recent passport size photographs and attested copies of mark sheets, certificates etc., should be sent to the Registrar, IASST, Paschim Boragaon, Garchuk, Guwahati – 781035, Assam, so as to reach on or before 5/05/2014.</p>

<p>A. Research Associate:</p>

<p>Number of vacancies: 1 (One)</p>

<p>Qualifications:</p>

<p>PhD in Bioinformatics or allied disciplines with knowledge of Bioinformatics. The candidates who have submitted PhD thesis may also apply.</p>

<p>In case, candidates having PhD are not found, candidates having MSc in Bioinformatics or allied disciplines with sound knowledge of Bioinformatics will be preferred.</p>

<p>Remuneration: Candidate having PhD will get a consolidated remuneration of Rs. 22,000/- +HRA per month. MSc having NET/GATE/SLET qualified candidate will get a remuneration of Rs. 16,000/= and HRA and candidate with only MSc will get a remuneration of Rs.14,000/- and HRA.</p>

<p>Tenure:</p>

<p>The post is initially for one year and may be extended depending on the performance till the tenure of the project.</p>

<p>B. Traineeship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate with a postgraduate degree in Bioinformatics/Biotechnology/Life sciences from a recognised University</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>C. Studentship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate pursuing M.Sc in bioinformatics in a recognised University.</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>Advertisement:</p>

<p>http://iasst.gov.in/pdf/recruitment/advt%20no_2_24042014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</guid>
	<pubDate>Fri, 30 May 2014 06:21:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</link>
	<title><![CDATA[NCBI Gene Screencast]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/WyFIf7YdM8A" frameborder="0" allowfullscreen></iframe>A short walkthrough of the NCBI Gene page]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26569/genome-stability-laboratory</guid>
  <pubDate>Mon, 07 Mar 2016 04:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Genome Stability Laboratory]]></title>
  <description><![CDATA[
<p>The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims. </p>

<p>More at http://faculty.iisertvm.ac.in/~nishantkt/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</guid>
	<pubDate>Tue, 26 Dec 2017 21:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</link>
	<title><![CDATA[PASA: Gene Structure Annotation and Analysis]]></title>
	<description><![CDATA[<p><span>PASA, acronym for Program to Assemble Spliced Alignments, is a eukaryotic genome annotation tool that exploits spliced alignments of expressed transcript sequences to automatically model gene structures, and to maintain gene structure annotation consistent with the most recently available experimental sequence data. PASA also identifies and classifies all splicing variations supported by the transcript alignments.</span></p><p>Address of the bookmark: <a href="http://pasapipeline.github.io/" rel="nofollow">http://pasapipeline.github.io/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37460/revigo-reduced-visualize-gene-ontology</guid>
	<pubDate>Tue, 31 Jul 2018 05:28:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37460/revigo-reduced-visualize-gene-ontology</link>
	<title><![CDATA[REVIGO: Reduced Visualize gene ontology]]></title>
	<description><![CDATA[<div>REViGO can take long lists of Gene Ontology terms and summarize them by removing redundant GO terms. The remaining terms can be visualized in semantic similarity-based scatterplots, interactive graphs, or tag clouds.&nbsp;<a href="http://dx.doi.org/10.1371/journal.pone.0021800">More about REViGO...</a>&nbsp;|&nbsp;<a href="http://revigo.irb.hr/about_hr.jsp"><img src="http://revigo.irb.hr/gfx/croatian-wCrown.png" alt="In Croatian" title="" width="12" height="15" style="border: 0px;"></a></div>
<div>Please enter a list of Gene Ontology IDs below, each on its own line. The GO IDs may be followed by p-values or another quantity which describes the GO term in a way meaningful to you.&nbsp;<img src="http://revigo.irb.hr/gfx/qmark.png" alt="For instance, you may provide a p-value          (statistical significance), a fold change, enrichment, or some          directly measured quantity such as average signal intensity from          microarrays, ion count from mass spec, or read count from RNA-seq.          You may also provide more than one value per line, although only the          first value will be used in GO term selection/clustering." title="" width="16" height="15" style="border: 0px;"></div><p>Address of the bookmark: <a href="http://revigo.irb.hr/" rel="nofollow">http://revigo.irb.hr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>