<?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/30440?offset=1700</link>
	<atom:link href="https://bioinformaticsonline.com/related/30440?offset=1700" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</guid>
	<pubDate>Thu, 23 Nov 2017 08:37:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</link>
	<title><![CDATA[Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence]]></title>
	<description><![CDATA[<p><span>Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp&nbsp;</span><em>Saccharina japonica</em><span>. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at&nbsp;</span><a href="http://sdittami.altervista.org/taxoblast" title="">http://sdittami.altervista.org/taxoblast</a><span>&nbsp;and via SourceForge (</span><a href="https://sourceforge.net/projects/taxoblast" title="">https://sourceforge.net/projects/taxoblast</a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/taxoblast/files/" rel="nofollow">https://sourceforge.net/projects/taxoblast/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22239/jrf-bioinformatics-at-national-institute-of-high-security-animal-diseases-icar</guid>
  <pubDate>Tue, 28 Apr 2015 02:21:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at National Institute of High Security Animal Diseases (ICAR)]]></title>
  <description><![CDATA[
<p>F.No. 4-59/2013-NIHSAD Dated: 21st April, 2015</p>

<p>SRF/ JRF job vacancies in National Institute of High Security Animal Diseases (ICAR)</p>

<p>Name of Post : JRF</p>

<p>No. of Post : 01</p>

<p>Qualification : M.V.Sc or M.Tech./M.Sc. (preferably with NET qualification) in one of following disciplines. (Biotechnology/Molecular Biology/Genetics/Microbiology/Bioinformatics or equivalent Life Sciences discipline). Desirable: Working Knowledge in the areas of Recombinant DNA Techniques, Cell Culture, Handling Laboratory Animals, Genomics.</p>

<p>Emolument : Rs.16,000/-</p>

<p>Age Limit : Up to 30 years</p>

<p>Name of Post : Project Assistant</p>

<p>No of Post : 01</p>

<p>Qualifications : First class M.Sc. /B.E/B.Tech. in one of the following disciplines Biotechnology/ Bioinformatics/ Microbiology or equivalent Life Sciences discipline). Desirable : Exposure of working in research environment, Good command over written/spoken English and computer applications.</p>

<p>Emolument : Rs.8000/-</p>

<p>Age Limit : Upto 28 years</p>

<p>Name of Post : Project Assistant</p>

<p>No of Post : 01</p>

<p>Qualification : First class M.Sc. /B.V.Sc. and A.H., B.Tech. /B.E. in Life Sciences and related areas. Desirable: Exposure of working in research environment, Good command over written/type written/spoken English and computer applications. </p>

<p>Emoluments : Rs. 8000/-</p>

<p>Age Limit : Up to 28 years<br />How to apply</p>

<p>Desirous candidates may send their applications by e-mail (techcell@hsadl.nic.in ) followed by post in the prescribed proforma latest by 11/05/2015. Walk-in-Interview will be held at NIHSAD, Kokta Road, Anand Nagar, Bhopal-462022.</p>

<p>http://www.nihsad.nic.in/pdf/Advt.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</guid>
	<pubDate>Fri, 18 May 2018 08:28:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</link>
	<title><![CDATA[Ancestral sequence reconstruction steps !]]></title>
	<description><![CDATA[<div><strong>Ancestral sequence reconstruction</strong>&nbsp;(<strong>ASR</strong>) &ndash; also known as&nbsp;<strong>ancestral gene</strong>/<strong>sequence reconstruction</strong>/<strong>resurrection</strong>&nbsp;&ndash; is a technique used in the study of&nbsp;molecular evolution. The method consists of the synthesis of an ancestral&nbsp;gene&nbsp;and expression of the corresponding ancestral&nbsp;protein.&nbsp;<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;Steven A. Benner, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</div><div>&nbsp;</div><div>BEAST is the best way to predict the ancestral structure. but, I suggest following steps?</div><div>&nbsp;</div><div>1- Alignments "Mafft -&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fmafft.cbrc.jp%2Falignment%2Fsoftware%2Fsource.html" target="_blank">http://mafft.cbrc.jp/alignment/software/source.html</a>"</div><div>mafft --maxiterate 1000 --reorder --thread 24 --genafpair Dataset.fasta &gt; Dataset_Alig.fasta</div><div>&nbsp;</div><div>2- Your dataset has a good phylogenetic signal, is possible to perform with Tree-Puzzle "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.tree-puzzle.de" target="_blank">http://www.tree-puzzle.de</a>";</div><div>&nbsp;</div><div id="yui_3_14_1_1_1526649596608_1443">3 - This dataset which the saturation index, I perform with "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fdambe.bio.uottawa.ca%2Fdambe.asp" target="_blank">http://dambe.bio.uottawa.ca/dambe.asp</a>";</div><div>&nbsp;</div><div>4- Has evidence of possible recombination in your dataset, the evaluate if this presence or absence, because this may to influence the grouping of clades, I perform with</div><div>---recombination</div><div>&nbsp;</div><div>4.1- Phi-test, implemented in SplitTree4"<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.splitstree.org" target="_blank">http://www.splitstree.org</a>", (.nex file)</div><div>&nbsp;</div><div>4.2- GARD deployed in webserver in the DataMonkey "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.datamonkey.org%2F" target="_blank">http://www.datamonkey.org/</a>" - turning to the amino acid seaview -&gt; view proteins -&gt; save as ...) Ideally do a tree-based groups.</div><div>&nbsp;</div><div>4.3- RDP4 for download and installation on Windows in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fweb.cbio.uct.ac.za%2F~darren%2Frdp.html" target="_blank">http://web.cbio.uct.ac.za/~darren/rdp.html</a>"</div><div>&nbsp;</div><div>4.4- Hyphy (Mac, Windows, Linux) in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fhyphy.org%2Fw%2Findex.php%2FDownload" target="_blank">http://hyphy.org/w/index.php/Download</a>"</div><div>&nbsp;</div><div>4.5- Path-o-Gen (temporal structure of a tree input file -&gt; arquivo.tre)</div><div>These steps above, I call of pre-processing to inferences phylogenetic...</div><div>&nbsp;</div><div>5- Perform phylogenetic tree, used Bayesian Inference with Molecular Clock, but is necessary Clock Testing:</div><div>&nbsp;</div><div>- This step is performed with program Beast (Beauti, Beast and TreeAnnotator), and Tracer_v1.5 more FigTree to inspection.</div><div>&nbsp;</div><div>- Tutorials:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Ftutorials" target="_blank">http://beast.bio.ed.ac.uk/tutorials</a></div><div>- Downloads:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Fdownloads" target="_blank">http://beast.bio.ed.ac.uk/downloads</a></div>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22285/project-associate-bioinformatics-iit-mandi</guid>
  <pubDate>Wed, 06 May 2015 06:18:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Associate Bioinformatics @ IIT Mandi]]></title>
  <description><![CDATA[
<p>Eligibility : MSc(Bio-Informatics, Bio-Tech), BSc, BE/B.Tech(Bio-Medical /Bio-Technology Engg, CSE)</p>

<p>Location : Kulu</p>

<p>Job Category : Govt Jobs, Research</p>

<p>Last Date : 20 May 2015</p>

<p>Job Type : Full Time</p>

<p>Hiring Process : Walk - In<br />IIT Mandi - Job Details<br />IIT Mandi</p>

<p>Project Associate Bioinformatics Job vacancies in IIT Mandi on purely temporary</p>

<p>Project: “Exploring the Human Microbiome: A hunt for the candidates for Pre- and Pro-biotics.”</p>

<p>Minimum Qualification and Experience: M.Sc. in Bioinformatics OR B.Tech / BE in Bioinformatics OR M. Sc. in Biotechnology / Life sciences or related areas with Diploma or relevant experience in Bioinformatics OR B.Tech in Biotechnology / Computer Science or MCA or B. Sc. in Life Sciences or related areas with PG diploma in Bioinformatics. Candidates with experience in NGS data handling and analysis will be preferred. Tenure: Initially for one year, extendable based upon performance.</p>

<p>No of Posts: 01</p>

<p>Salary: Rs. 12000- 18000/- per month.</p>

<p>How to apply</p>

<p>Interested candidates can come for a Walk-in-Interview on 20th May 2015 starting at 8:30 AM at the Academic Block, Indian Institute of Technology (IIT), Mandi, Vallabh College Campus, Near Bus Stand, Mandi, HP. The candidates should bring along their curriculum vitae (CV) and copies of educational and experience certificates. In case of any queries please contact: Dr. Tulika Prakash Srivastava (Principal Investigator), Indian Institute of Technology Mandi, Near Bus Stand Mandi - 175 001, Himachal Pradesh.</p>

<p>More at</p>

<p>http://www.iitmandi.ac.in/administration/advrt/Walk-in-interview_Ad.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</guid>
	<pubDate>Fri, 19 Oct 2018 08:48:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb&nbsp;</span><a href="https://www.nature.com/articles/nature25458">Axolotl</a><span>&nbsp;genome at a speed tens of times faster than&nbsp;</span><a href="https://github.com/marbl/canu">CANU</a><span>&nbsp;and&nbsp;</span><a href="https://github.com/PacificBiosciences/FALCON">FALCON</a><span>while producing contigs of comparable base accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22317/project-associate-bioinformatics-central-food-technological-research-institute-cftri</guid>
  <pubDate>Tue, 19 May 2015 07:01:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Associate Bioinformatics @ Central Food Technological Research Institute (CFTRI)]]></title>
  <description><![CDATA[
<p>Central Food Technological Research Institute (CFTRI)</p>

<p>Project Assistant (Level-II) job position in Central Food Technological Research Institute (CFTRI) on a temporary contractual basis in the research project (GAP 0469) funded by Science &amp; Engineering Research Board (SERB), Government of India, New Delhi tenable at the Lipidomics Centre, CSIR-CFTRI, Mysore, Karnataka</p>

<p>Name of the Position : </p>

<p>Qualification : First class M. Sc. in Biochemistry/Microbiology/Genetics/ Bioinformatics with good academic record and preferably with experience in molecular biology techniques and basic knowledge of molecular biology and biological chemistry</p>

<p>Emoluments : Rs. 12,000/- per month (Consolidated)</p>

<p>Age Limit : The upper age limit for applying shall be 28 years (as on 22-5-2015), which is relaxed for candidates belonging to Scheduled Castes/Schedule Tribes, Women, Persons with Disabilities (PWD) and OBCs as per GoI norms. <br /> <br />How to apply</p>

<p>Eligible candidates may send their complete Bio-data with e-mail address/contact phone number along with attested copies of the necessary certificates through post to Prof. Ram Rajasekharan, Lipidomics Centre, Department of Lipid Science, CSIR-CFTRI, Mysore-570 020, Karnataka (email: ram@cftri.res.in) on or before 22.05.2015</p>

<p>More at http://www.cftri.com/pa_gap0469.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22430/nrco-vacancies-for-junior-research-fellow-%E2%80%93-pakyong-sikkim</guid>
  <pubDate>Thu, 28 May 2015 19:10:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[NRCO Vacancies For Junior Research Fellow – Pakyong, Sikkim]]></title>
  <description><![CDATA[
<p>Junior Research Fellow<br />Pay Scale:Rs 25,000/-<br />Educational Requirements:MSc (with NET qualification) / M.Tech degree (with or without NET) with minimum 55% marks in Biotechnology/ Bioinformatics/ Molecular Biology or any other related field.<br />Other Qualification:Computer Skills (Linux, Perl, Java, MySQL) with experience in advanced molecular Biology techniques.<br />No of Post: 01<br />How To Apply: Walk-in-Interviews will be held at ICAR-National Research Centre for Orchids,Pakyong 737106, Sikkim for the post of 01 (One) Junior Research Fellow and 01 (One) Project Attendant under Project ‘DBT’s Twinning programme for the NE’ titled “Assessment of chemical and genetic divergence of some fragrant orchids of north-east India for sustainable improvement of community livelihood” as indicated below. The appointment will be on contractual basis and the incumbents shall not have any claim for regular appointment in ICAR.</p>

<p>Details will be available at: http://nrcorchids.nic.in/Employments/Vacancy%20-%20JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</guid>
	<pubDate>Sat, 15 Feb 2020 01:49:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</link>
	<title><![CDATA[CLARK: Fast, accurate and versatile sequence classification system]]></title>
	<description><![CDATA[<p><span></span><a href="http://dx.doi.org/10.1186/s12864-015-1419-2"><strong>CLARK</strong></a><span>, a method based on a supervised sequence classification using discriminative&nbsp;</span><em>k</em><span>-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.</span></p>
<p><span><a href="http://clark.cs.ucr.edu/Spaced/">http://clark.cs.ucr.edu/Spaced/</a></span></p><p>Address of the bookmark: <a href="http://clark.cs.ucr.edu/Spaced/" rel="nofollow">http://clark.cs.ucr.edu/Spaced/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Mon, 18 Jan 2021 10:47:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>