<?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/31205?offset=930</link>
	<atom:link href="https://bioinformaticsonline.com/related/31205?offset=930" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</guid>
	<pubDate>Mon, 24 Jul 2023 07:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</link>
	<title><![CDATA[Bioinformatics tools for genome assembly !]]></title>
	<description><![CDATA[<p>There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021:</p><ol>
<li>
<p><span>SPAdes:</span> An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.</p>
</li>
<li>
<p><span>ABySS:</span> A parallelized assembler for large genomes that uses de Bruijn graphs.</p>
</li>
<li>
<p><span>Velvet:</span> Another de Bruijn graph-based assembler optimized for short-read sequencing data.</p>
</li>
<li>
<p><span>SOAPdenovo:</span> A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.</p>
</li>
<li>
<p><span>MaSuRCA:</span> A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.</p>
</li>
<li>
<p><span>Canu:</span> A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.</p>
</li>
<li>
<p><span>Flye:</span> A long-read assembler suitable for bacterial and small eukaryotic genomes.</p>
</li>
<li>
<p><span>SMARTdenovo:</span> An assembler designed for long reads, particularly suited for PacBio data.</p>
</li>
<li>
<p><span>SPAdes Long Read (SPAdesLR):</span> An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.</p>
</li>
<li>
<p><span>Minia:</span> An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.</p>
</li>
<li>
<p><span>Unicycler:</span> A hybrid assembler that combines short and long reads for circular bacterial genome assembly.</p>
</li>
<li>
<p><span>wtdbg2:</span> A de Bruijn graph assembler for long reads, efficient for very large genomes.</p>
</li>
<li>
<p><span>Shasta:</span> A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.</p>
</li>
<li>
<p><span>Sparc:</span> An assembler designed to handle noisy long reads from Nanopore sequencing.</p>
</li>
<li>
<p><span>CANA:</span> An assembler for metagenomic data, particularly for complex and diverse microbial communities.</p>
</li>
<li>
<p><span>Ra</span> Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.</p>
</li>
</ol><p>Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44581/biokit-a-set-of-tools-dedicated-to-bioinformatics-data-visualisation</guid>
	<pubDate>Tue, 18 Jun 2024 02:04:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44581/biokit-a-set-of-tools-dedicated-to-bioinformatics-data-visualisation</link>
	<title><![CDATA[BioKit: a set of tools dedicated to bioinformatics, data visualisation]]></title>
	<description><![CDATA[<p><span>BioKit is a set of tools dedicated to bioinformatics, data visualisation (</span><a href="https://biokit.readthedocs.io/en/latest/references.html#module-biokit.viz" title="biokit.viz"><code><span>biokit.viz</span></code></a><span>), access to online biological data (e.g. UniProt, NCBI thanks to bioservices). It also contains more advanced tools related to data analysis (e.g.,&nbsp;</span><a href="https://biokit.readthedocs.io/en/latest/references.html#module-biokit.stats" title="biokit.stats"><code><span>biokit.stats</span></code></a><span>). Since R is quite common in bioinformatics, we also provide a convenient module to run R inside your Python scripts or shell (:mod:biokit.rtools module).</span></p><p>Address of the bookmark: <a href="https://biokit.readthedocs.io/en/latest/index.html" rel="nofollow">https://biokit.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</guid>
	<pubDate>Tue, 22 Apr 2014 20:53:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</link>
	<title><![CDATA[BioCodes/BioScripts]]></title>
	<description><![CDATA[<p>Over the years most bioinformatics people amass a collection of small utility scripts which make their lives easier. Too often they are kept either in private repositories or as part of a public collection to which noone else can contribute. Biocode is a curated repository of general-use utility scripts.</p>
<p>Algorithms scripts @ https://github.com/jschendel/bioinformatics-algorithms-coursera</p><p>Address of the bookmark: <a href="https://github.com/jorvis/biocode" rel="nofollow">https://github.com/jorvis/biocode</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</guid>
	<pubDate>Tue, 07 Feb 2017 05:08:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</link>
	<title><![CDATA[Perl Special Vars Quick Reference]]></title>
	<description><![CDATA[<table>
<tbody>
<tr>
<td><tt>$_</tt></td>
<td>The default or implicit variable.</td>
</tr>
<tr>
<td><tt>@_</tt></td>
<td>Subroutine parameters.</td>
</tr>
<tr>
<td><tt>$a</tt><br /><tt>$b</tt></td>
<td><a href="http://perldoc.perl.org/functions/sort.html">sort</a>&nbsp;comparison routine variables.</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>The command-line args.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Regular Expressions</span></td>
</tr>
<tr>
<td><tt>$&lt;digit&gt;</tt></td>
<td>Regexp parenthetical capture holders.</td>
</tr>
<tr>
<td><tt>$&amp;</tt></td>
<td>Last successful match (degrades performance).</td>
</tr>
<tr>
<td><tt>${^MATCH}</tt></td>
<td>Similar to&nbsp;<tt>$&amp;</tt>&nbsp;without performance penalty. Requires /p modifier.</td>
</tr>
<tr>
<td><tt>$`</tt></td>
<td>Prematch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^PREMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$`</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$'</tt></td>
<td>Postmatch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^POSTMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$'</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$+</tt></td>
<td>Last paren match.</td>
</tr>
<tr>
<td><tt>$^N</tt></td>
<td>Last closed paren match (last submatch).</td>
</tr>
<tr>
<td><tt>@+</tt></td>
<td>Offsets of ends of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>@-</tt></td>
<td>Offsets of starts of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>%+</tt></td>
<td>Like&nbsp;<tt>@+</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>%-</tt></td>
<td>Like&nbsp;<tt>@-</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>${^RE_DEBUG_FLAGS}</tt></td>
<td>Current value of regexp debugging flags. See&nbsp;<tt>use re 'debug';</tt></td>
</tr>
<tr>
<td><tt>${^RE_TRIE_MAXBUF}</tt></td>
<td>Control memory allocations for RE optimizations for large alternations.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Encoding</span></td>
</tr>
<tr>
<td><tt>${^ENCODING}</tt></td>
<td>The object reference to the Encode object, used to convert the source code to Unicode.</td>
</tr>
<tr>
<td><tt>${^OPEN}</tt></td>
<td>Internal use: \0 separated Input / Output layer information.</td>
</tr>
<tr>
<td><tt>${^UNICODE}</tt></td>
<td>Read-only Unicode settings.</td>
</tr>
<tr>
<td><tt>${^UTF8CACHE}</tt></td>
<td>State of the internal UTF-8 offset caching code.</td>
</tr>
<tr>
<td><tt>${^UTF8LOCALE}</tt></td>
<td>Indicates whether UTF8 locale was detected at startup.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">IO and Separators</span></td>
</tr>
<tr>
<td><tt>$.</tt></td>
<td>Current line number (or record number) of most recent filehandle.</td>
</tr>
<tr>
<td><tt>$/</tt></td>
<td>Input record separator.</td>
</tr>
<tr>
<td><tt>$|</tt></td>
<td>Output autoflush. 1=autoflush, 0=default. Applies to currently selected handle.</td>
</tr>
<tr>
<td><tt>$,</tt></td>
<td>Output field separator (lists)</td>
</tr>
<tr>
<td><tt>$\</tt></td>
<td>Output record separator.</td>
</tr>
<tr>
<td><tt>$"</tt></td>
<td>Output list separator. (interpolated lists)</td>
</tr>
<tr>
<td><tt>$;</tt></td>
<td>Subscript separator. (Use a real multidimensional array instead.)</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Formats</span></td>
</tr>
<tr>
<td><tt>$%</tt></td>
<td>Page number for currently selected output channel.</td>
</tr>
<tr>
<td><tt>$=</tt></td>
<td>Current page length.</td>
</tr>
<tr>
<td><tt>$-</tt></td>
<td>Number of lines left on page.</td>
</tr>
<tr>
<td><tt>$~</tt></td>
<td>Format name.</td>
</tr>
<tr>
<td><tt>$^</tt></td>
<td>Name of top-of-page format.</td>
</tr>
<tr>
<td><tt>$:</tt></td>
<td>Format line break characters</td>
</tr>
<tr>
<td><tt>$^L</tt></td>
<td>Form feed (default "\f").</td>
</tr>
<tr>
<td><tt>$^A</tt></td>
<td>Format Accumulator</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Status Reporting</span></td>
</tr>
<tr>
<td><tt>$?</tt></td>
<td>Child error. Status code of most recent system call or pipe.</td>
</tr>
<tr>
<td><tt>$!</tt></td>
<td>Operating System Error. (What just went 'bang'?)</td>
</tr>
<tr>
<td><tt>%!</tt></td>
<td>Error number hash</td>
</tr>
<tr>
<td><tt>$^E</tt></td>
<td>Extended Operating System Error (Extra error explanation).</td>
</tr>
<tr>
<td><tt>$@</tt></td>
<td>Eval error.</td>
</tr>
<tr>
<td><tt>${^CHILD_ERROR_NATIVE}</tt></td>
<td>Native status returned by the last pipe close, backtick (`` ) command, successful call to wait() or waitpid(), or from the system() operator.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">ID's and Process Information</span></td>
</tr>
<tr>
<td><tt>$$</tt></td>
<td>Process ID</td>
</tr>
<tr>
<td><tt>$&lt;</tt></td>
<td>Real user id of process.</td>
</tr>
<tr>
<td><tt>$&gt;</tt></td>
<td>Effective user id of process.</td>
</tr>
<tr>
<td><tt>$(</tt></td>
<td>Real group id of process.</td>
</tr>
<tr>
<td><tt>$)</tt></td>
<td>Effective group id of process.</td>
</tr>
<tr>
<td><tt>$0</tt></td>
<td>Program name.</td>
</tr>
<tr>
<td><tt>$^O</tt></td>
<td>Operating System name.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Perl Status Info</span></td>
</tr>
<tr>
<td><tt>$]</tt></td>
<td>Old: Version and patch number of perl interpreter. Deprecated.</td>
</tr>
<tr>
<td><tt>$^C</tt></td>
<td>Current value of flag associated with&nbsp;<strong>-c</strong>&nbsp;switch.</td>
</tr>
<tr>
<td><tt>$^D</tt></td>
<td>Current value of debugging flags</td>
</tr>
<tr>
<td><tt>$^F</tt></td>
<td>Maximum system file descriptor.</td>
</tr>
<tr>
<td><tt>$^I</tt></td>
<td>Value of the&nbsp;<strong>-i</strong>&nbsp;(inplace edit) switch.</td>
</tr>
<tr>
<td><tt>$^M</tt></td>
<td>Emergency Memory pool.</td>
</tr>
<tr>
<td><tt>$^P</tt></td>
<td>Internal variable for debugging support.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>$^S</tt></td>
<td>Exceptions being caught. (eval)</td>
</tr>
<tr>
<td><tt>$^T</tt></td>
<td>Base time of program start.</td>
</tr>
<tr>
<td><tt>$^V</tt></td>
<td>Perl version.</td>
</tr>
<tr>
<td><tt>$^W</tt></td>
<td>Status of -w switch</td>
</tr>
<tr>
<td><tt>${^WARNING_BITS}</tt></td>
<td>Current set of warning checks enabled by&nbsp;<tt>use warnings;</tt></td>
</tr>
<tr>
<td><tt>$^X</tt></td>
<td>Perl executable name.</td>
</tr>
<tr>
<td><tt>${^GLOBAL_PHASE}</tt></td>
<td>Current phase of the Perl interpreter.</td>
</tr>
<tr>
<td><tt>$^H</tt></td>
<td>Internal use only: Hook into Lexical Scoping.</td>
</tr>
<tr>
<td><tt>%^H</tt></td>
<td>Internaluse only: Useful to implement scoped pragmas.</td>
</tr>
<tr>
<td><tt>${^TAINT}</tt></td>
<td>Taint mode read-only flag.</td>
</tr>
<tr>
<td><tt>${^WIN32_SLOPPY_STAT}</tt></td>
<td>If true on Windows&nbsp;<tt>stat()</tt>&nbsp;won't try to open the file.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Command Line Args</span></td>
</tr>
<tr>
<td><tt>ARGV</tt></td>
<td>Filehandle iterates over files from command line (see also&nbsp;<tt>&lt;&gt;</tt>).</td>
</tr>
<tr>
<td><tt>$ARGV</tt></td>
<td>Name of current file when reading &lt;&gt;</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>List of command line args.</td>
</tr>
<tr>
<td><tt>ARGVOUT</tt></td>
<td>Output filehandle for -i switch</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Miscellaneous</span></td>
</tr>
<tr>
<td><tt>@F</tt></td>
<td>Autosplit (-a mode) recipient.</td>
</tr>
<tr>
<td><tt>@INC</tt></td>
<td>List of library paths.</td>
</tr>
<tr>
<td><tt>%INC</tt></td>
<td>Keys are filenames, values are paths to modules included via&nbsp;<tt>use, require,&nbsp;</tt>or&nbsp;<tt>do</tt>.</td>
</tr>
<tr>
<td><tt>%ENV</tt></td>
<td>Hash containing current environment variables</td>
</tr>
<tr>
<td><tt>%SIG</tt></td>
<td>Signal handlers.</td>
</tr>
<tr>
<td><tt>$[</tt></td>
<td>Array and substr first element (Deprecated!).</td>
</tr>
</tbody>
</table><p>&nbsp;</p><p>See&nbsp;<a href="http://perldoc.perl.org/perlvar.html">perlvar</a>&nbsp;for detailed descriptions of each of these (and a few more) special variables.</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10380/ra-at-alagappa-university</guid>
  <pubDate>Sun, 04 May 2014 23:33:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at ALAGAPPA UNIVERSITY]]></title>
  <description><![CDATA[
<p>DEPARTMENT OF BIOTECHNOLOGY<br />(UGC SAP and DST-FIST &amp; PURSE Sponsored Department)<br />ALAGAPPA UNIVERSITY<br />(A State University Accredited by NAAC with „A‟ Grade)<br />Karaikudi - 630 004, India</p>

<p>WALK IN INTERVIEW</p>

<p>A walk-in Interview for the following position tenable at the Bioinformatics Infrastructure Facility (BIF), Department of Biotechnology, Alagappa University will be held at the Department of Biotechnology, Alagappa University, Karaikudi 630 003 on 15.05.2014 (Thursday) at 01:00 PM. This national facility is funded by the Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi. The main objectives of the Centre involve teaching and research activities in bioinformatics/biotechnology.</p>

<p>RA (One Post):</p>

<p>Salary : Rs. 11000 p.m. plus admissible HRA</p>

<p>Qualification: M.Sc., in Bioinformatics/Biotechnology/Biophysics/Biochemistry/ Life Sciences</p>

<p>Interested candidates are encouraged to send their Curriculum Vitae by email to “sk_pandian@rediffmail.com” in advance. On the day of interview, the candidates must produce original certificates in proof of their educational qualification and experience and a recommendation letter from the Head of the Department/Institution where last studied/worked. Candidates who have already passed the required Degree alone are eligible to appear for interview. No TA&amp;DA will be given for attending the interview.</p>

<p>Advertisement: http://www.alagappabiotech.org/Walk%20in%20interview.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10459/associate-professor-bio-informatics-at-university-of-allahabad-in-allahabad</guid>
  <pubDate>Wed, 07 May 2014 00:26:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Bio-Informatics at University of Allahabad in Allahabad]]></title>
  <description><![CDATA[
<p>No of vacancies: 01</p>

<p>Pay scale: Pay Band of Rs. 37400-67000 with AGP of Rs. 9000.</p>

<p>i. Educational Qualification: Good academic record with a Ph.D. Degree in the concerned/allied/relevant disciplines.</p>

<p>ii. A Master's Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>iii. A minimum of eight years of experience of teaching and/or research in an academic/research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/industry excluding the period of Ph.D. research with evidence of published work and a minimum of 5 publications as books and/or research/policy papers.</p>

<p>iv. Contribution to educational innovation, design of new curricula and courses, and technology - mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>v. A minimum score as stipulated in the Academic Performance Indicator (API) based Performance Based Appraisal System (PBAS), set out in UGC Regulation.</p>

<p>Download application form from website: http://www.allduniv.ac.in/</p>

<p>Send your application to the Registrar, University of Allahabad, Allahabad-211002 (U.P.) on or before 30th April 2014</p>

<p>For more details: http://www.allduniv.ac.in/images/adv/backlog/advt-details.pdf OR http://www.allduniv.ac.in/images/news/extension-notice.pdf</p>

<p>Last Apply Date: 30 May 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</guid>
	<pubDate>Sat, 10 May 2014 04:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</link>
	<title><![CDATA[DNA Replication Process [3D Animation]]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/27TxKoFU2Nw" frameborder="0" allowfullscreen></iframe>See an organised list of all the animations: http://doctorprodigious.wordpress.com/hd-animations/]]></description>
	
</item>

</channel>
</rss>