<?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/28290?offset=1100</link>
	<atom:link href="https://bioinformaticsonline.com/related/28290?offset=1100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</guid>
	<pubDate>Sun, 09 Dec 2018 19:06:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</link>
	<title><![CDATA[DECIPHER; a software toolset for deciphering and managing biological sequences efficiently using the R]]></title>
	<description><![CDATA[<p><span>DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;programming language. The&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;package is distributed as platform independent source code under the&nbsp;</span><a href="http://www.gnu.org/copyleft/gpl.html">GPL version 3 license</a><span>. Some functionality of the program is accessible online through web tools.</span></p>
<p><span style="font-size: medium; text-align: justify;">&nbsp;</span></p><p>Address of the bookmark: <a href="http://www2.decipher.codes/" rel="nofollow">http://www2.decipher.codes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</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/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</guid>
	<pubDate>Fri, 01 Feb 2019 11:55:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</link>
	<title><![CDATA[Evaluation of genome assembly software based on long reads]]></title>
	<description><![CDATA[<p>TGS technologies have been used to produce highly accurate de novo assemblies of hundreds of microbial genomes and highly contiguous reconstructions of many dozens of plant and animal genomes, enabling new insights into evolution and sequence diversity. They have also been applied to resequencing analyses, to create detailed maps of structural variations in many species. Also, these new technologies have been used to fill in many of the gaps in the human reference genome.</p><p>In this report, we compare and evaluate several genome assembly software based on TSG technology. The experimentation has been performed on 4 reference genomes and the results evaluated with the QUAST software. The 11 software that have been evaluated are: Celera Assembler , Falcon , Miniasm, Newbler , SGA Assembler, Smartdenovo, Abruijn, Ra, DBG2OLC, Spades and Cerulean. The first 8 software use only long reads, while the 3 last software can merge long and short reads</p>]]></description>
	<dc:creator>BioStar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38886" length="382699" type="application/pdf" />
</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/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</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/blog/view/42188/tools-and-method-for-haplotype-phasing</guid>
	<pubDate>Fri, 04 Sep 2020 20:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</link>
	<title><![CDATA[Tools and Method for Haplotype phasing !]]></title>
	<description><![CDATA[<div>Huge amounts of genotype data are being produced with recent technological advances, both from increasingly&nbsp; comprehensive and inexpensive genome-wide SNP microarrays and from ever more accessible whole-genome and whole-exome sequencing methods. The vast amount of knowledge contained in these results, however, is best&nbsp; exploited through phased haplotypes, which classify the alleles co-located on the same chromosome. Since sequence and SNP array data normally take the form of unphased genotypes, one does not specifically observe which of the two parental chromosomes, or haplotypes, falls on a specific allele. Fortunately, new advances in both computational and laboratory methods promise improved determination of haplotype phase. Following are useful tools :</div><div>&nbsp;</div><p><strong>Arlequin:</strong>&nbsp;<a href="http://cmpg.unibe.ch/software/arlequin3/" target="_blank">http://cmpg.unibe.ch/software/arlequin3/</a></p><p><strong>BEAGLE:</strong>&nbsp;<a href="http://faculty.washington.edu/browning/beagle/beagle.html" target="_blank">http://faculty.washington.edu/browning/beagle/beagle.html</a></p><p><strong>fastPHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>GENEHUNTER:</strong>&nbsp;<a href="http://linkage.rockefeller.edu/soft/gh/" target="_blank">http://linkage.rockefeller.edu/soft/gh/</a></p><p><strong>The Genome Analysis Toolkit:</strong></p><p><a href="http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit</a></p><p><strong>IMPUTE2:</strong>&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" target="_blank">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p><p><strong>MACH:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/MACH/" target="_blank">http://www.sph.umich.edu/csg/abecasis/MACH/</a></p><p><strong>MERLIN:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/Merlin/" target="_blank">http://www.sph.umich.edu/csg/abecasis/Merlin/</a></p><p><strong>PHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>PL-EM:</strong>&nbsp;<a href="http://www.people.fas.harvard.edu/~junliu/plem/" target="_blank">http://www.people.fas.harvard.edu/~junliu/plem/</a></p><p><strong>&ldquo;Read-backed phasing&rdquo; algorithm</strong>:&nbsp;<a href="http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm</a></p><p><strong>SHAPE-IT:</strong>&nbsp;<a href="http://www.griv.org/shapeit/" target="_blank">http://www.griv.org/shapeit/</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/9868/raghavas-group</guid>
  <pubDate>Tue, 15 Apr 2014 23:59:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Raghava's Group]]></title>
  <description><![CDATA[
<p>Raghava's group is known for developing open source software or web servers. Group have developed large number of web-based services.</p>

<p>Find more at http://www.imtech.res.in/raghava/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36373/tools-to-predict-the-impact-of-missense-variants</guid>
	<pubDate>Mon, 23 Apr 2018 12:57:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36373/tools-to-predict-the-impact-of-missense-variants</link>
	<title><![CDATA[Tools to Predict the Impact of Missense Variants !]]></title>
	<description><![CDATA[<p><span>Prioritizing missense variants for further experimental investigation is a key challenge in current sequencing studies for exploring complex and Mendelian diseases. A large number of&nbsp;</span><em>in silico</em><span>&nbsp;tools have been employed for the task of pathogenicity prediction, including PolyPhen‐2, SIFT, FatHMM, MutationTaster‐2, MutationAssessor, Combined Annotation Dependent Depletion, LRT, phyloP, and GERP++, as well as optimized methods of combining tool scores, such as Condel and Logit. Due to the wealth of these methods, an important practical question to answer is which of these tools generalize best, that is, correctly predict the pathogenic character of new variants. </span></p><p><span>Study of 10 tools on five datasets that such a comparative evaluation of these tools is hindered by two types of circularity: they arise due to (1) the same variants or (2) different variants from the same protein occurring both in the datasets used for training and for evaluation of these tools, which may lead to overly optimistic results. Comparative evaluations of predictors that do not address these types of circularity may erroneously conclude that circularity confounded tools are most accurate among all tools, and may even outperform optimized combinations of tools.</span></p><p><span>Following tools are useful for mis sense muation detection ...&nbsp;</span></p><p>PolyPhen‐2 (PP2)<br />&ldquo;Predicts possible impact of an amino acid substitution on the structure and function of a human protein using straightforward physical and comparative considerations&rdquo;</p><p>MutationTaster‐2 (MT2)<br />&ldquo;Evaluation of the disease‐causing potential of DNA sequence alterations&rdquo;</p><p>MutationAssessor (MASS)<br />&ldquo;Predicts the functional impact of amino acid substitutions in proteins, such as mutations discovered in cancer or missense polymorphisms&rdquo;</p><p>LRT<br />&ldquo;Identify a subset of deleterious mutations that disrupt highly conserved amino acids within protein‐coding sequences, which are likely to be unconditionally deleterious&rdquo;</p><p>SIFT<br />&ldquo;Predicts whether an amino acid substitution affects protein function&rdquo;</p><p>GERP++<br />&ldquo;Identifies constrained elements in multiple alignments by quantifying substitution deficits. These deficits represent substitutions that would have occurred if the element were neutral DNA, but did not occur because the element has been under functional constraint. We refer to these deficits as &ldquo;rejected substitutions.&rdquo; Rejected substitutions are a natural measure of constraint that reflects the strength of past purifying selection on the element&rdquo;</p><p>phyloP<br />&ldquo;Compute conservation or acceleration P values based on an alignment and a model of neutral evolution&rdquo;</p><p>FatHMM unweighted (FatHMM‐U)<br />Predicts &ldquo;functional consequences of both coding variants, that is, nonsynonymous single‐nucleotide variants, and noncoding variants&rdquo;</p><p>FatHMM weighted (FatHMM‐W)<br />Predicts &ldquo;functional consequences of both coding variants, that is, nonsynonymous single‐nucleotide variants, and noncoding variants&rdquo; and its weighting scheme attributes higher tolerance scores to SNVs in proteins, related proteins, or domains that already include a high fraction of pathogenic variantsh</p><p>Combined Annotation Dependent Depletion (CADD)<br />&ldquo;CADD is a tool for scoring the deleteriousness of single‐nucleotide variants as well as insertion/deletions variants in the human genome&rdquo;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>