<?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/26309?offset=300</link>
	<atom:link href="https://bioinformaticsonline.com/related/26309?offset=300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/8330/atlas-of-ancient-inter-ethnic-group</guid>
	<pubDate>Fri, 14 Feb 2014 13:16:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/8330/atlas-of-ancient-inter-ethnic-group</link>
	<title><![CDATA[Atlas of ancient inter-ethnic group !!!]]></title>
	<description><![CDATA[<p>Now a dayz, almost 3% of the world's population lived outside their country of origin. These migration is increasingly being perceived as a force that can contribute to development, and an integral aspect of the global development process.&nbsp; While migrants make important contributions to the economic prosperity of their host countries, the flow of financial, technological, social and human capital back to their countries of origin also is having a significant impact on poverty reduction and economic development.</p><p>However, the ancient invasions and migrations to slavery and trade, history is embroidered with events that led to interactions between previously separate populations. Early humans migrated due to many factors such as changing climate and landscape and inadequate food supply. Historical migration of human populations begins with the movement of Homo erectus out of Africa across Eurasia about a million years ago. Homo sapiens appear to have occupied all of Africa about 150,000 years ago, moved out of Africa 70,000 years ago, and had spread across Australia, Asia and Europe by 40,000 years BC. Indo-Aryan migration from the Indus Valley to the plain of the River Ganges in Northern India is presumed to have taken place in the Middle to Late Bronze Age, contemporary to the Late Harappan phase in India (ca. 1700 to 1300 BC). From 180 BC, a series of invasions from Central Asia followed, including those led by the Indo-Greeks, Indo-Scythians, Indo-Parthians and Kushans in the northwestern Indian subcontinent.</p><p><img src="http://upload.wikimedia.org/wikipedia/commons/3/37/Map-of-human-migrations.jpg" alt="image" style="border: 0px; border: 0px;"></p><p>Using the recent advance technologies researchers have created a historical atlas of instances of such mixing. They use a sophisticated statistical method for making inferences about human history and&nbsp;infer populations interbredings ( happen over the past 4,000 years) with an ease.<br /><br />The study published the findings and presented with an interactive map. http://admixturemap.paintmychromosomes.com/</p><p>These sort of genomic study have some limilation. It is hard to precisely define sources of mixing when it occurred between genetically similar groups, and scenarios involving multiple waves of mixing over time or between multiple groups can be difficult to tease apart. But it is believed that larger sample sizes will improve resolution. These high resolution will provide a deeper understanding of human history.</p><p>Reference:</p><p>http://www.sciencemag.org/content/early/2014/01/28/science.1245938</p><p>http://www.ncbi.nlm.nih.gov/pubmed/21390129?dopt=Abstract&amp;holding=npg</p><p>http://www.csulb.edu/~kmacd/paper-ethnicity.html</p><p>Image: Wikipedia</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9055/computational-biologist-scientist-strand-life-sciences</guid>
  <pubDate>Fri, 14 Mar 2014 11:36:56 -0500</pubDate>
  <link></link>
  <title><![CDATA[Computational Biologist Scientist @ Strand Life Sciences]]></title>
  <description><![CDATA[
<p>We are looking for a motivated application scientist to help evaluate, compare, and develop next generation sequencing (NGS) data analysis methods. The successful candidate should be able to quickly understand the state-of-art computational biology techniques, prototype them and perform benchmarking studies. The candidate must also be comfortable working with people from different disciplines and be able to present data analysis results in a clear and effective manner. The candidate is also expected to interact with customers as needed, write technical reports and publish new methods and/or data analysis findings in public forums.</p>

<p>Candidate Requirements: A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered. The successful candidate must be motivated and capable of working independently as well as in team environment.</p>

<p>Eligible and interested candidates can email your resumes to rohit at strandls dot com</p>

<p>About Strand Life Sciences: Strand was founded in 2000 by computer science and mathematics professors who recognized the need to automate and integrate life science data analysis through an algorithmic and computational approach. Strand’s solutions for life sciences research are robust and easy to use by the most novice user while powerful and configurable for the bioinformatician. Using its award-winning application development platform, AVADIS®, Strand builds innovative products that enable fast and cutting-edge analysis for basic and clinical research, drug discovery and development.</p>

<p>http://www.avadis-ngs.com/careers</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35429/list-of-visualization-tools-for-genome-alignments</guid>
	<pubDate>Fri, 02 Feb 2018 13:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35429/list-of-visualization-tools-for-genome-alignments</link>
	<title><![CDATA[List of visualization tools for genome alignments]]></title>
	<description><![CDATA[<p><span>Genome</span><span>&nbsp;browsers are useful not only for showing final results but also for improving analysis protocols, testing data quality, and generating result drafts. Its integration in analysis pipelines allows the optimization of parameters, which leads to better results. But sometime, we need publication ready figure of genomes. Following are the list of genome alignment visualization tools, which could be useful for analysis and&nbsp;interpretation of results:</span></p><p>ABySS Explorer</p><p>Interactive Java application that uses a novel graph-based representation to display a sequence assembly and associated metadata</p><p>http://www.bcgsc.ca/platform/bioinfo/software/abyss-explorer</p><p>BamView</p><p>Genome browser and annotation tool that allows visualization of sequence features, next-generation sequencing (NGS) data and the results of analyses within the context of the sequence, and also its six-frame translation</p><p>http://www.sanger.ac.uk/resources/software/artemis/</p><p>DNannotator&nbsp;</p><p>Annotation web toolkit for regional genomic sequences</p><p>http://bioapp.psych.uic.edu/DNannotator.htm</p><p>JVM&nbsp;</p><p>Java Visual Mapping tool for NGS reads</p><p>http://www.springer.com/cda/content/document/cda_downloaddocument/9789401792448-c2.pdf?SGWID=0-0-45-1487072-p176815501</p><p>LookSeq&nbsp;</p><p>Web-based visualization of sequences derived from multiple sequencing technologies. Low- or high-depth read pileups and easy visualization of putative single nucleotide and structural variation</p><p>http://lookseq.sourceforge.net</p><p>MagicViewer&nbsp;</p><p>Visualization of short read alignment, identification of genetic variation and association with annotation information of a reference genome</p><p>http://bioinformatics.zj.cn/magicviewer/</p><p>MapView&nbsp;</p><p>Alignments of huge-scale single-end and pair-end short reads</p><p>http://omictools.com/mapview-s1367.html</p><p>MultiPipMaker</p><p>Computes alignments of similar regions in two DNA sequences. The resulting alignments are summarized with a &lsquo;percent identity plot&rsquo; (pip)</p><p>http://pipmaker.bx.psu.edu/pipmaker/</p><p>PileLineGUI&nbsp;</p><p>Handling genome position files in NGS studies</p><p>http://sing.ei.uvigo.es/pileline/pilelinegui.html</p><p>SAMtools tview&nbsp;</p><p>Simple and fast text alignment viewer; NGS compatible</p><p>http://www.htslib.org/</p><p>SEWAL</p><p>Uses a locality-sensitive hashing algorithm to enumerate all unique sequences in an entire Illumina sequencing run</p><p>http://www.sourceforge.net/projects/sewal</p><p>STAR&nbsp;</p><p>A web-based integrated solution to management and visualization of sequencing data</p><p>http://wanglab.ucsd.edu/star/browser</p><p>SVA&nbsp;</p><p>Software for annotating and visualizing sequenced human genomes</p><p>http://www.svaproject.org</p><p>Viewer (IGV)&nbsp;</p><p>Visualization of large heterogeneous datasets, providing a smooth and intuitive user experience at all levels of genome resolution</p><p>https://www.broadinstitute.org/igv/</p><p>ZOOM Lite&nbsp;</p><p>NGS data mapping and visualization software</p><p>http://bioinfor.com/zoom/lite/</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9039/postdoc-position-in-computational-biology</guid>
  <pubDate>Fri, 14 Mar 2014 01:38:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc Position in Computational Biology]]></title>
  <description><![CDATA[
<p>The Computational Biology Group of Interdisciplinary Center for<br />Clinical Research (IZKF) Aachen, RWTH Aachen University Hospital,<br />Aachen, invites applicants for PhD candidate or postdoctoral position<br />in computational biology in one of the following topics:</p>

<p>1) Statistical machine learning methods for the analysis of medical<br />epigenomics data.</p>

<p>2) Sequence analysis algorithms for detection of RNA-DNA interactions.</p>

<p>Applicants should hold a M.Sc . or PhD in Computer Science or related<br />areas. Experience in the analysis of biological sequences, gene<br />expression and gene regulation is desirable. The candidate should have<br />solid programming skills (C, Python and/or R) and acquaintance with<br />Linux. Experience with high performance computing is a plus. The<br />working language of the group is English.</p>

<p>The position is based on the German TV-L 13 salary scale, including<br />all German social benefits (health insurance and pension scheme). The<br />expected starting date is September 2014. Interested candidates should<br />send a CV, statement of research interests and the names of three<br />references to jobs@costalab.org.</p>

<p>More at http://costalab.org/wp/phd-and-postdoc-position-in-computational-biology/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/9207/biogeek-fun</guid>
	<pubDate>Sun, 16 Mar 2014 06:33:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/9207/biogeek-fun</link>
	<title><![CDATA[BioGeek Fun]]></title>
	<description><![CDATA[<p>1. A futuristic computational biology student was told to write "It is in my gene!!!" on the board 100 times as a punishment. here's his response -<br /><br />use warnings;<br />for ($count=1; $count &lt;=100; $count++) { print "It is in my gene!!!";}<br /><br />I guess, he is gonna to be a real biogeek. Nice try though. Smart kid.</p><p>&nbsp;</p><p>2. In some perl script I found this <br />&nbsp;. . . . . .<br />&nbsp;. . . . . .<br /># It works for me, only God understood how it is working<br />while (/(&lt;\/[^&gt;]+&gt;)|(&lt;[^&gt;]+&gt;)|(&lt;[^&gt;]+&gt;)$|([^&gt;&lt;]+)/go) {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; $startGene=$1;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; $beginChromosome=$2;<br />&nbsp;&nbsp; &nbsp;<br />. . . . . .<br />&nbsp;.. . . . . .<br />}</p><p>&nbsp;</p><p>3. One more interesting message in Perl found &hellip;. It will must tickle you bone :) <br />open(my $fh, "&lt;", "gene.txt")&nbsp;&nbsp; &nbsp;or kill " Me if you think this is a mistake :$!";<br /><br /></p><p>&nbsp;</p><p>4. From the Perl <br /><br />&nbsp; while () {&nbsp; # "The Mothership Connection is here!"<br />&nbsp;&nbsp; &nbsp;print &ldquo;$_\n&rdquo;; # Printing the offspring :)</p><p>&nbsp;</p><p>5. Perl message<br />if ($1) { print &ldquo;Just found a the error in chromosome !!!, yahoo&hellip;&rdquo;; else { &ldquo;That is not error, but mutation you moron!&rdquo;;</p><p>&nbsp;</p><p>6. One genome database curator walk in wine bar asked the bartender:<br />CREATE TABLE gene IF NOT EXISTS SexOnTheBeach;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/9327/jarvis%E2%80%99-laboratory</guid>
  <pubDate>Tue, 18 Mar 2014 18:53:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Jarvis’ laboratory]]></title>
  <description><![CDATA[
<p>Dr. Jarvis’ laboratory studies the neurobiology of vocal communication. We want to know how the brain generates, perceives, and learns behavior. We use vocal communication as a model behavior. Emphasis is placed on the molecular pathways involved in the perception and production of learned vocalizations. We use an integrative approach that combines behavioral, anatomical, electrophysiological, and molecular biological techniques. The main animal model used is songbirds, one of the few vertebrate groups that evolved the ability to learn vocalizations. The overall goal of the research is to advance knowledge of the neural mechanisms for vocal learning and basic mechanisms of brain function.</p>

<p>Lab page: http://jarvislab.net/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9518/professor-and-associate-professors-pb-iv-assistant-professors-pb-iii-job-at-iiit-allahabad</guid>
  <pubDate>Mon, 31 Mar 2014 08:09:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Professor and Associate Professors (PB-IV) Assistant Professors (PB-III) Job at IIIT, Allahabad]]></title>
  <description><![CDATA[
<p>Indian Institute of Information Technology, Allahabad <br />Devghat, Jhalwa, Allahabad – 211012, Uttar Pradesh, India <br />E-mail: contact@iiita.ac.in, faculty.applications@iiita.ac.in <br />Web: www.iiita.ac.in Phone : 0532-2922031/27/67 </p>

<p>Applications are invited on prescribed format along with self attested copies of the certificates for Faculty Positions in the following areas:  <br />Sciences – Systems Biology, Computer Aided Drug Designing, Statistics, Applied Mathematics, Applied Physics. BioMedical Engineering – BioMechanics, BioMedical Instrumentation.  </p>

<p> Last Date : May 10, 2014 </p>

<p>Details are available on our website : http://www.iiita.ac.in</p>

<p>http://www.iiita.ac.in/downloads/announcements/uploads/FACULTY_Advertisement_NO-FS-01_2014130.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</guid>
	<pubDate>Sun, 06 Apr 2014 23:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</link>
	<title><![CDATA[Find certain files/documents in Linux OS]]></title>
	<description><![CDATA[<p>As bioinformatician I know the fact that we usually handle the large dataset and lost in the huge numbers of files and folders. In order to search the missing file a strong search command is required. The Linux Find Command is one of the most important and much used command in Linux sytems. Find command used to search and locate list of files and directories based on conditions you specify for files that match the arguments. Find can be used in variety of conditions like you can find files by permissions, users, groups, file type, date, size and other possible criteria.<br /><br />Through this article we are sharing our day-to-day Linux find command experience and its usage in the form of examples. In this article we will show you the most used 35 Find Commands examples in Linux. We have divided the section into Five parts from basic to advance usage of find command.</p><p><strong>Part I &ndash; Basic Find Commands for Finding Files with Names</strong><br />1. Find Files Using Name in Current Directory<br /><br />Find all the files whose name is gene.txt in a current working directory.<br /><br /># find . -name gene.txt<br /><br />./gene.txt<br /><br />2. Find Files Under Home Directory<br /><br />Find all the files under /home directory with name gene.txt.<br /><br /># find /home -name gene.txt<br /><br />/home/gene.txt<br /><br />3. Find Files Using Name and Ignoring Case<br /><br />Find all the files whose name is gene.txt and contains both capital and small letters in /home directory.<br /><br /># find /home -iname gene.txt<br /><br />./gene.txt<br />./Gene.txt<br /><br />4. Find Directories Using Name<br /><br />Find all directories whose name is Gene in / directory.<br /><br /># find / -type d -name Gene<br /><br />/Gene<br /><br />5. Find fasta Files Using Name<br /><br />Find all php files whose name is gene.fasta in a current working directory.<br /><br /># find . -type f -name gene.fasta<br /><br />./gene.fasta<br /><br />6. Find all PHP Files in Directory<br /><br />Find all fasta files in a directory.<br /><br /># find . -type f -name "*.fasta"<br /><br />./gene.fasta<br />./cancer.fasta<br />./allgene.fasta<br /><br /><strong>Part II &ndash; Find Files Based on their Permissions</strong><br />7. Find Files With 777 Permissions<br /><br />Find all the files whose permissions are 777.<br /><br /># find . -type f -perm 0777 -print<br /><br />8. Find Files Without 777 Permissions<br /><br />Find all the files without permission 777.<br /><br /># find / -type f ! -perm 777<br /><br />9. Find SGID Files with 644 Permissions<br /><br />Find all the SGID bit files whose permissions set to 644.<br /><br /># find / -perm 2644<br /><br />10. Find Sticky Bit Files with 551 Permissions<br /><br />Find all the Sticky Bit set files whose permission are 551.<br /><br /># find / -perm 1551<br /><br />11. Find SUID Files<br /><br />Find all SUID set files.<br /><br /># find / -perm /u=s<br /><br />12. Find SGID Files<br /><br />Find all SGID set files.<br /><br /># find / -perm /g+s<br /><br />13. Find Read Only Files<br /><br />Find all Read Only files.<br /><br /># find / -perm /u=r<br /><br />14. Find Executable Files<br /><br />Find all Executable files.<br /><br /># find / -perm /a=x<br /><br />15. Find Files with 777 Permissions and Chmod to 644<br /><br />Find all 777 permission files and use chmod command to set permissions to 644.<br /><br /># find / -type f -perm 0777 -print -exec chmod 644 {} \;<br /><br />16. Find Directories with 777 Permissions and Chmod to 755<br /><br />Find all 777 permission directories and use chmod command to set permissions to 755.<br /><br /># find / -type d -perm 777 -print -exec chmod 755 {} \;<br /><br />17. Find and remove single File<br /><br />To find a single file called gene.txt and remove it.<br /><br /># find . -type f -name "gene.txt" -exec rm -f {} \;<br /><br />18. Find and remove Multiple File<br /><br />To find and remove multiple files such as .fa or .gb, then use.<br /><br /># find . -type f -name "*.fa" -exec rm -f {} \;<br /><br />OR<br /><br /># find . -type f -name "*.gb" -exec rm -f {} \;<br /><br />19. Find all Empty Files<br /><br />To file all empty files under certain path.<br /><br /># find /tmp -type f -empty<br /><br />20. Find all Empty Directories<br /><br />To file all empty directories under certain path.<br /><br /># find /tmp -type d -empty<br /><br />21. File all Hidden Files<br /><br />To find all hidden files, use below command.<br /><br /># find /tmp -type f -name ".*"<br /><br /><strong>Part III &ndash; Search Files Based On Owners and Groups</strong><br />22. Find Single File Based on User<br /><br />To find all or single file called gene.txt under / root directory of owner root.<br /><br /># find / -user root -name gene.txt<br /><br />23. Find all Files Based on User<br /><br />To find all files that belongs to user Rahul under /home directory.<br /><br /># find /home -user rahul<br /><br />24. Find all Files Based on Group<br /><br />To find all files that belongs to group Developer under /home directory.<br /><br /># find /home -group developer<br /><br />25. Find Particular Files of User<br /><br />To find all .txt files of user Rahul under /home directory.<br /><br /># find /home -user rahul -iname "*.txt"<br /><br /><strong>Part IV &ndash; Find Files and Directories Based on Date and Time</strong><br />26. Find Last 50 Days Modified Files<br /><br />To find all the files which are modified 50 days back.<br /><br /># find / -mtime 50<br /><br />27. Find Last 50 Days Accessed Files<br /><br />To find all the files which are accessed 50 days back.<br /><br /># find / -atime 50<br /><br />28. Find Last 50-100 Days Modified Files<br /><br />To find all the files which are modified more than 50 days back and less than 100 days.<br /><br /># find / -mtime +50 &ndash;mtime -100<br /><br />29. Find Changed Files in Last 1 Hour<br /><br />To find all the files which are changed in last 1 hour.<br /><br /># find / -cmin -60<br /><br />30. Find Modified Files in Last 1 Hour<br /><br />To find all the files which are modified in last 1 hour.<br /><br /># find / -mmin -60<br /><br />31. Find Accessed Files in Last 1 Hour<br /><br />To find all the files which are accessed in last 1 hour.<br /><br /># find / -amin -60<br /><br /><strong>Part V &ndash; Find Files and Directories Based on Size</strong><br />32. Find 50MB Files<br /><br />To find all 50MB files, use.<br /><br /># find / -size 50M<br /><br />33. Find Size between 50MB &ndash; 100MB<br /><br />To find all the files which are greater than 50MB and less than 100MB.<br /><br /># find / -size +50M -size -100M<br /><br />34. Find and Delete 100MB Files<br /><br />To find all 100MB files and delete them using one single command.<br /><br /># find / -size +100M -exec rm -rf {} \;<br /><br />35. Find Specific Files and Delete<br /><br />Find all .gb files with more than 10MB and delete them using one single command.<br /><br /># find / -type f -name *.gb -size +10M -exec rm {} \;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10127/assistant-professor-at-sardar-patel-university</guid>
  <pubDate>Mon, 21 Apr 2014 21:03:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at SARDAR PATEL UNIVERSITY]]></title>
  <description><![CDATA[
<p>SARDAR PATEL UNIVERSITY<br />Centre for Interdisciplinary Studies in Science and Technology</p>

<p>No.: SPU/CISST/Advt./2014-15/519</p>

<p>ADVERTISEMENT for Teaching Positions (Contractual)</p>

<p>Applications for the following Contractual Teaching Position are invited for Centre for Interdisciplinary Studies in Science and Technology (CISST), Sardar Patel University:</p>

<p>2. Assistant Professor (ONE) (Contractual)</p>

<p>For the subject of Bioinformatics</p>

<p>Qualifications:</p>

<p>(I) Good academic record as defined by the concerned university with at least 55 % marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s level</p>

<p>(II) Ph.D. degree in the concerned subject or in a relevant interdisciplinary subject<br />from an Indian University or NET/SLET clearance Contractual appointment carries a total Fixed Emoluments of Rs. 30,000/- p.m without any assurance of permanent Positions and related benefits.</p>

<p>An Application Form in prescribed Performa, available on University Website: www.spuvvn.edu should be filled in completely in Twelve Copies with self attested copies of certificates of qualifications and experience. Only one copy of each mark sheet be attached with the first copy of the application form. All 12 (Twelve) Application forms should be sent to Registrar’s office along with Demand Draft of Application form fee of Rs. 250/- (Non-refundable) in favour of “REGISTRAR, SARDAR PATEL UNIVERSITY, VALLABH VIDYANAGAR”. The S.C. and S.T. category candidates need not to pay Application fee.</p>

<p>Applicants who are in service should apply through their present employers. Candidates called for interview shall be required to attend at their own cost.</p>

<p>In absence of suitable candidate, the University may relax the eligibility criteria, for conditional appointment.</p>

<p>The last date of receipt of application by the University is 30th April, 2014</p>

<p>Advertisement: www.spuvvn.edu/careers/CISST%20Advt.%20April%202014.pdf</p>
]]></description>
</item>

</channel>
</rss>