<?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/2422?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/2422?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25410/srfjrf-bioinformatics-at-ciari</guid>
  <pubDate>Fri, 04 Dec 2015 00:10:09 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF Bioinformatics at CIARI]]></title>
  <description><![CDATA[
<p>Realizing the importance of Island Agriculture to meet the requirements of local population and tourists, Indian Council of Agricultural research (ICAR) established Central Island Agricultural Research Institute, Port Blair on June 23rd, 1978 by merging different regional research stations of ICAR institutes located in Islands. The ultimate aim of CIARI is the developments of island agricultural production technologies which utilizes the strengths of the island and convert the constraints in opportunities, without causing any ill effect to the fragile ecosystem of the island.The institute has made tremendous progress in the Agriculture development of the islands during the last three decades. Keeping in view the natural resources of the islands diversity, fragile ecosystem, research program would be designed to maximize the productivity without disturbing to the islands ecosystem to provide better and decent livelihood and as a source of revenue and resource generation. Research and development in Agriculture sector should cover all disciplines in order to have a balanced progress in all disciplines for the overall benefits of the farmers of these islands.</p>

<p>Position I</p>

<p>Job Title : Junior Research Fellow</p>

<p>No. of Posts : One</p>

<p>Project : Establishment of sub distributed information centre</p>

<p>Qualification : M.Sc in Basic Science with NET or B.Sc in professional course with NET or M.Sc in professional course</p>

<p>Desired Experience : Experience in Bioinformatics and molecular biology</p>

<p>Payscale : Rs. 25000 per month</p>

<p>Age Limit : Upto 35 for men and 40 for women with 5 years relaxation to SC/ST and 3 years relaxation for OBC.</p>

<p>Position II</p>

<p>Job Title : Traineeship</p>

<p>No. of Posts : One</p>

<p>Project : Establishment of sub distributed information centre</p>

<p>Qualification : B.Sc Bioinformatics /Biotechnology / Life Science / Computer Science</p>

<p>Desired Experience : Experience in Bioinformatics and molecular biology</p>

<p>Payscale : Rs. 8000 per month</p>

<p>Age Limit : Upto 35 for men and 40 for women with 5 years relaxation to SC/ST and 3 years relaxation for OBC.</p>

<p>Position III</p>

<p>Job Title : Studentship</p>

<p>No. of Posts : Two</p>

<p>Project : Establishment of sub distributed information centre</p>

<p>Qualification : B.Sc Bioinformatics /Biotechnology / Life Science / Computer Science</p>

<p>Desired Experience : Experience in Bioinformatics and molecular biology</p>

<p>Payscale : Rs. 8000 per month</p>

<p>Age Limit : Upto 35 for men and 40 for women with 5 years relaxation to SC/ST and 3 years relaxation for OBC.</p>

<p>How to Apply : Candidates who meet the requirements can attend the walk in interview at CIARI,Port Blair on 09.12.2015 10.30AM.</p>

<p>http://icar-ciari.res.in/employment/9-12-15.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26221/project-assistant-at-iiser-mohali</guid>
  <pubDate>Fri, 29 Jan 2016 11:04:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant at IISER Mohali]]></title>
  <description><![CDATA[
<p>Project Assistant Job position in Indian Institute of Science Education &amp; Research (IISER) Mohali </p>

<p>Title : In silico understanding of molecular basis of recognition, binding, and regulation of mRNA by STAR family of transcriptional regulators.</p>

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

<p>Department : Science and Technology</p>

<p>Qualifications : M.Sc./B.Tech in computational life sciences, computational chemistry, computational natural sciences or allied areas. Working experience in MD simulations, bioinformatics, molecular modeling, and drug designing is desirable and plus</p>

<p>Emoluments : As per DST norms<br />How to apply</p>

<p>Applicants are requested to send application along with bio-data and a summary of previous projects (if any) as a PDF file with the e-mail to Dr. Monika Sharma, Email: mnsharma@iisermohali.ac.in. Last date of applications is 17:00 IST. Feb 15, 2016. Shortlisted candidates will be called for interview on Feb 22, 2016. </p>

<p>More at http://14.139.227.202/tenders/tenderinvite/index.php/iiserm-project-openings/554-applications-are-invited-to-work-as-project-assistant-in-a-dst-inspire-research-project-funded-by-department-of-science-and-technology-india</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2728/statistics-of-current-sequencing-and-bioinformatics-market</guid>
	<pubDate>Wed, 21 Aug 2013 08:29:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2728/statistics-of-current-sequencing-and-bioinformatics-market</link>
	<title><![CDATA[Statistics of current Sequencing and Bioinformatics market]]></title>
	<description><![CDATA[<p>This survey conducted by&nbsp;<strong>Oxford&nbsp;<a href="http://www.ogt.co.uk/" target="_blank">Gene</a>&nbsp;Technology,</strong>&nbsp;<span>provider of innovative&nbsp;genetics&nbsp;research and&nbsp;biomarker</span>&nbsp;<span>solutions to advance molecular medicine, has released the results from a recent survey of researchers using next generation sequencing. (Source:<a href="http://www.news-medical.net/news/20130821/Oxford-Gene-Technology-releases-next-generation-sequencing-survey-results.aspx">http://www.news-medical.net/news/20130821/Oxford-Gene-Technology-releases-next-generation-sequencing-survey-results.aspx</a>&nbsp;)</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.ogt.com/assets/0000/3190/NGS_Survey_2013_Infographic_Web.pdf" rel="nofollow">http://www.ogt.com/assets/0000/3190/NGS_Survey_2013_Infographic_Web.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4888/murray-coxs-genomicus-lab</guid>
  <pubDate>Thu, 26 Sep 2013 16:42:42 -0500</pubDate>
  <link></link>
  <title><![CDATA[Murray Cox's Genomicus Lab]]></title>
  <description><![CDATA[
<p>This group interested in modeling genome dynamics in following topics:</p>

<p>---how genetic variation is distributed within and between individuals, <br />---determining how this diversity changes over evolutionary time.</p>

<p>Hence, Cox group work at the interface between biology, statistics and computer science to address questions of outstanding biological importance through intrepretation of large genetic datasets.</p>

<p>Profile:<br />Associate Professor Murray Cox, <br />Inaugural Rutherford Fellow of the Royal Society of New Zealand,  Principal Investigator in the BioProtection Research Center and Associate Investigator in the Allan Wilson Center for Molecular Ecology and Evolution<br />Email : m.p.cox@massey.ac.nz<br />Webpage: http://massey.genomicus.com/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36191/bioinformatics-workshops-no-coding-required</guid>
	<pubDate>Mon, 09 Apr 2018 13:06:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36191/bioinformatics-workshops-no-coding-required</link>
	<title><![CDATA[Bioinformatics Workshops - NO CODING REQUIRED]]></title>
	<description><![CDATA[<p><img src="https://edu.t-bio.info/wp-content/uploads/2018/03/t-bioinfo-bioinformatics-workshops.jpg" alt="Bioinformatics Workshops T-BioInfo" width="568" height="319" style="vertical-align: middle; border: 0px;"></p><p>Pine Biotech, Inc., a US-based startup working with the Tauber Bioinformatics Research Center is offering a full curriculum online preparing students without any technical background for real-life challenges with large scale biomedical data. Workshops on processing, analysis and biomedical interpretation of Next Generation Sequencing data cover important up-to-date algorithms and machine learning approaches. The most important thing is that there are virtually no pre-requisites such as coding, biostatistics or advanced medical skills. If you know what gene is and how the genes are expressed, you are ready to take the courses or join our workshops. Learn more:&nbsp;https://edu.t-bio.info/workshops/</p>]]></description>
	<dc:creator>eliabrodsky</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30015/scripts</guid>
	<pubDate>Wed, 30 Nov 2016 10:35:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30015/scripts</link>
	<title><![CDATA[Scripts]]></title>
	<description><![CDATA[<p>Useful script for NGS analysis.</p><p>Address of the bookmark: <a href="http://augustus.gobics.de/binaries/scripts/" rel="nofollow">http://augustus.gobics.de/binaries/scripts/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37509/vcftools-perform-common-tasks-with-vcf-files-such-as-file-validation-file-merging-intersecting-complements</guid>
	<pubDate>Tue, 07 Aug 2018 10:01:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37509/vcftools-perform-common-tasks-with-vcf-files-such-as-file-validation-file-merging-intersecting-complements</link>
	<title><![CDATA[VCFtools: perform common tasks with VCF files such as file validation, file merging, intersecting, complements]]></title>
	<description><![CDATA[<p>VCFtools contains a Perl API (<a href="http://vcftools.sourceforge.net/perl_module.html#Vcf.pm">Vcf.pm</a>) and a number of Perl scripts that can be used to perform common tasks with VCF files such as file validation, file merging, intersecting, complements, etc. The Perl tools support all versions of the VCF specification (3.2, 3.3, 4.0, 4.1 and 4.2), nevertheless, the users are encouraged to use the latest versions VCFv4.1 or VCFv4.2. The VCFtools in general have been used mainly with diploid data, but the Perl tools aim to support polyploid data as well. Run any of the Perl scripts with the&nbsp;<strong>--help</strong>&nbsp;switch to obtain more help.</p>
<p>Many of the&nbsp;<strong>Perl scripts require that the VCF files are compressed by&nbsp;<span>bgzip</span>&nbsp;and indexed by&nbsp;<span>tabix</span></strong>&nbsp;(both tools are part of the tabix package, available for&nbsp;<a href="https://sourceforge.net/projects/samtools/files/tabix/">download here</a>). The VCF files can be compressed and indexed using the following commands</p>
<p>bgzip my_file.vcf<br>tabix -p vcf my_file.vcf.gz</p>
<p>&nbsp;</p>
<p>http://vcftools.sourceforge.net/perl_module.html</p><p>Address of the bookmark: <a href="http://vcftools.sourceforge.net/perl_module.html" rel="nofollow">http://vcftools.sourceforge.net/perl_module.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</guid>
	<pubDate>Sat, 08 Jun 2024 16:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</link>
	<title><![CDATA[MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly]]></title>
	<description><![CDATA[<p><span>The MetaGraph framework</span><span>&nbsp;is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as&nbsp;</span><a href="https://metagraph.ethz.ch/#query">sequence search</a><span>&nbsp;or&nbsp;</span><a href="https://metagraph.ethz.ch/#assembly">differential assembly</a><span>.</span></p>
<p><span>Searcg link&nbsp;https://metagraph.ethz.ch/search&nbsp;</span></p>
<p><span>Pre-print&nbsp;https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4&nbsp;</span></p><p>Address of the bookmark: <a href="https://metagraph.ethz.ch/" rel="nofollow">https://metagraph.ethz.ch/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</guid>
	<pubDate>Thu, 22 Mar 2018 10:40:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2.0: ultra fast and sensitive protein search and clustering suite]]></title>
	<description><![CDATA[<p>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein 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.</p>
<p>The MMseqs2 user guide is available as&nbsp;<a href="https://github.com/soedinglab/mmseqs2/wiki">Github Wiki</a>&nbsp;or as&nbsp;<a href="https://mmseqs.com/latest/userguide.pdf">PDF file</a>&nbsp;(Thanks to&nbsp;<a href="https://github.com/jgm/pandoc">pandoc</a>!)</p>
<p>Please cite:&nbsp;<a href="https://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3988.html">Steinegger M and Soeding J. MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nature Biotechnology, doi: 10.1038/nbt.3988 (2017)</a>.</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>Jit</dc:creator>
</item>

</channel>
</rss>