<?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/26629?offset=1180</link>
	<atom:link href="https://bioinformaticsonline.com/related/26629?offset=1180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</guid>
	<pubDate>Thu, 22 Jan 2015 22:29:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</link>
	<title><![CDATA[Bioinformatics Scripts]]></title>
	<description><![CDATA[<p>Some of the useful bioinformatics scripts.</p>
<p>For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly.</p>
<p>http://milkweedgenome.org/?q=scripts</p><p>Address of the bookmark: <a href="http://milkweedgenome.org/?q=scripts" rel="nofollow">http://milkweedgenome.org/?q=scripts</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</guid>
	<pubDate>Tue, 08 Nov 2022 03:40:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</link>
	<title><![CDATA[Tools for Differential expression analysis]]></title>
	<description><![CDATA[<p><span>apeglm</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/apeglm.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/apeglm.html</a></p><p><span>ashr</span>&nbsp;-&nbsp;<a href="https://github.com/stephens999/ashr" target="_blank">https://github.com/stephens999/ashr</a>,&nbsp;<a href="https://cran.r-project.org/web/packages/ashr/index.html" target="_blank">https://cran.r-project.org/web/packages/ashr/index.html</a></p><p><span>consensusDE</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/consensusDE.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/consensusDE.html</a></p><p><span>DESeq2</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/DESeq2.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/DESeq2.html</a></p><p><span>edgeR</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/edgeR.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/edgeR.html</a></p><p><span>limma</span>&nbsp;-&nbsp;<a href="https://kasperdanielhansen.github.io/genbioconductor/html/limma.html" target="_blank">https://kasperdanielhansen.github.io/genbioconductor/html/limma.html</a>&nbsp;&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/limma.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/limma.html</a></p><p><span>MetaCycle</span>&nbsp;-&nbsp;<a href="https://cran.r-project.org/web/packages/MetaCycle/index.html" target="_blank">https://cran.r-project.org/web/packages/MetaCycle/index.html</a>,&nbsp;<a href="https://github.com/gangwug/MetaCycle" target="_blank">https://github.com/gangwug/MetaCycle</a></p><p><span>RUVSeq</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/RUVSeq.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/RUVSeq.html</a></p><p><span>SARTools</span>&nbsp;-&nbsp;<a href="https://github.com/PF2-pasteur-fr/SARTools" target="_blank">https://github.com/PF2-pasteur-fr/SARTools</a></p><p><span>tximport</span>&nbsp;-&nbsp;<a href="https://github.com/mikelove/tximport" target="_blank">https://github.com/mikelove/tximport</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20672/jrfra-structuralcomputational-biology-at-icgeb</guid>
  <pubDate>Thu, 29 Jan 2015 11:52:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF/RA Structural/Computational Biology at ICGEB]]></title>
  <description><![CDATA[
<p>Research Associate and JRF positions in the Structural and Computational Biology Group starting 1st March 2015. Collaborative projects include work on:</p>

<p>a) bioinformatics, systems and computational biology <br />b) malaria <br />c) drug discovery <br />d) genomics <br />e) microbiology <br />f) metabolic disorders <br />g) molecular medicine</p>

<p>Eligibility: Applicants must have one of the following :</p>

<p>1) INSPIRE award for undertakig either PhD or Postdoctoral research; <br />2) SPM award for PhD; <br />3) JRF for pursuing PhD from CSIR/DBT/ICMR</p>

<p>Interest and experience in Biochemistry/Bioinformatics/Biophysics/ Chemistry/Genomics/Molecular Biology/ is essential.</p>

<p>Submit curriculum vitae to sb.icgeb@gmail.com by 20 February 2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</guid>
	<pubDate>Tue, 08 May 2018 04:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</link>
	<title><![CDATA[Metassembler: merging and optimizing de novo genome assemblies]]></title>
	<description><![CDATA[<p><span>Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies.</span></p>
<p><span><span>Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence.&nbsp;</span></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/metassembler/?source=directory" rel="nofollow">https://sourceforge.net/projects/metassembler/?source=directory</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21538/senior-research-fellow-at-all-india-institute-of-medical-sciences-aiims-delhi-delhi-delhi</guid>
  <pubDate>Wed, 11 Mar 2015 03:06:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[SENIOR RESEARCH FELLOW at All India Institute of Medical Sciences (AIIMS Delhi) - Delhi, Delhi]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the following temporary post in an ICMR funded Research Project entitle “An Investigation to find out reasons for Phenotypic Heterogeneity/Variability in 22q11.2 Microdeletion Syndrome” in Department of Reproductive Biology, AIIMS, New Delhi PI: Dr. Ashutosh Halder, Professor, Department of Reproductive Biology </p>

<p>Name of the post: Senior Research Fellow (SRF) <br />Duration: 2 year <br />Salary: Rs. 28000/- per month + 30% HRA <br />Eligibility: MSc (life sciences) with 2 years research experience, NET/GATE qualified <br />Desirable: Experience in the field of Genomics, Epigenomics &amp; Bioinformatics <br />SELECTION PROCEDURE FOR ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI) – SENIOR RESEARCH FELLOW POST: </p>

<p>Candidates can apply on or before 15/03/2015 <br />No Detailed information about the selection process is mentioned in the recruitment notification <br />HOW TO APPLY FOR SENIOR RESEARCH FELLOW VACANCY IN ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI): </p>

<p>Deadline: 15.03.15 Submit your C.V in Room No. 2099 (Molecular Cytogenetics Lab), 2nd floor, Reproductive Biology, All India Institute of Medical Sciences, New Delhi-110029 or Email CV to: ashutoshhalder@gmail.com Your CV should include the details of your work experience &amp; degrees along with two references with e-mail and contact number Only 10 shortlisted (on merit) candidates will be invited for interview. No TA/DA will be applicable for the same</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38238/list-of-motif-discovery-tools</guid>
	<pubDate>Tue, 20 Nov 2018 03:54:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38238/list-of-motif-discovery-tools</link>
	<title><![CDATA[List of motif discovery tools !]]></title>
	<description><![CDATA[<div><div>In genetics, a sequence motif is a nucleotide or amino-acid sequence pattern that is widespread and has, or is conjectured to have, a biological significance. For proteins, a sequence motif is distinguished from a structural motif, a motif formed by the three-dimensional arrangement of amino acids which may not be adjacent.</div><div>&nbsp;</div><div>Following are the list of tools for motif discovery:</div><div>&nbsp;</div><div><a href="http://genius.embnet.dkfz-heidelberg.de/menu/biounit/open-husar/">2Dsweep -- protein annotation by secondary structure elements</a></div><p>Perform secondary structure predictions on protein sequences.</p></div><div><div><a href="http://floresta.eead.csic.es/3dfootprint/">3D-footprint -- database of DNA-binding protein structures</a></div><p>Find binding specificity information about DNA-protein complexes.</p></div><div><div><a href="http://floresta.eead.csic.es/3dfootprint/">3D-footprint: DNA-binding protein database</a></div><p>Find information about the binding specificity of DNA-binding proteins.</p></div><div><div><a href="http://3d-partner.life.nctu.edu.tw/">3D-partner -- a web server to infer interacting partners and binding models</a></div><p>Predict interacting partners and binding models.</p></div><div><div><a href="http://motif.stanford.edu/distributions/3motif/">3MOTIF -- a protein structure visualization system for conserved sequence motifs</a></div><p>Use this web-based sequence motif visualization system to display sequence motif information in its appropriate three-dimensional (3D) context.</p></div><div><div><a href="http://bioinfo.mpiz-koeln.mpg.de/afawe/">AFAWE -- Automatic functional annotation in a distributed Web Services Environment</a></div><p>Protein function prediction and annotation in an integrated environment powered by web service.</p></div><div><div><a href="http://anchor.enzim.hu/">ANCHOR -- Prediction of Protein Binding Regions in Disordered Proteins</a></div><p>Find information about protein binding.</p></div><div><div><a href="http://annie.bii.a-star.edu.sg/annie/home.do">ANNIE -- ANNotation and Interpretation Environment for Protein Sequences</a></div><p>Use to predict function from de novo protein sequences.</p></div><div><div><a href="http://bioinformatica.isa.cnr.it/ASC/">Active Sequences Collection (ASC) database -- A new tool to assign functions to protein sequences</a></div><p>Search for short active protein sequences with demonstrated biological activities.</p></div><div><div><a href="http://blocks.fhcrc.org/">Blocks -- Ungapped segments in conserved protein sequences</a></div><p>Search for ungapped segments corresponding to the most highly conserved regions of proteins.</p></div><div><div><a href="http://cast.engr.uic.edu/">CASTp -- computed atlas of surface topography of proteins with structural and topographical mapping of functionally annotated residues</a></div><p>Identify and measure surface accessible pockets as well as interior inaccessible cavities, for proteins and other molecules.</p></div><div><div><a href="http://www.ebi.ac.uk/thornton-srv/databases/CSA">CSA -- The Catalytic Site Atlas</a></div><p>To search for catalytic residue annotation for enzymes in the Protein Data Bank.</p></div><div><div><a href="http://www.sbg.bio.ic.ac.uk/~confunc/">ConFunc -- Conserved residue Protein Function Prediction Server</a></div><p>Predict protein function using Gene Ontology.</p></div><div><div><a href="http://consurf.tau.ac.il/">ConSurf-DB -- evolutionary conservation profiles of protein structures database</a></div><p>Automatically calculate evolutionary conservation scores of key amino acid residues and map them on protein structures.</p></div><div><div><a href="http://salilab.org/DBAli/">DBAli -- A Database of Structure Alignments</a></div><p>Mine the protein structure space.</p></div><div><div><a href="http://dilimot.embl.de/">DILIMOT -- discovery of linear motifs in proteins</a></div><p>Predict short linear motifs (3-8 residues) in a set of protein sequences.</p></div><div><div><a href="http://www.ebi.ac.uk/dasty/">Dasty2 -- an Ajax protein DAS client</a></div><p>A web client for visualizing protein sequence feature information using DAS.</p></div><div><div><a href="http://genius.embnet.dkfz-heidelberg.de/menu/biounit/open-husar/">DomainSweep -- protein annotation by domain analysis</a></div><p>Identify the domain architecture within a protein sequence.</p></div><div><div><a href="http://e1ds.csbb.ntu.edu.tw/">E1DS -- catalytic site prediction based on 1D signatures of concurrent conservation</a></div><p>Predict enzyme catalytic site.</p></div><div><div><a href="http://elm.eu.org/">ELM -- Eukarotic Linear Motif Resource</a></div><p>Predict functional sites in eukaryotic proteins.</p></div><div><div><a href="http://us.expasy.org/tools/#proteome">EXPASY Proteome Tools Collection</a></div><p>Use a collection of tools for protein analyses.</p></div><div><div><a href="http://us.expasy.org/tools/findmod/">EXPASY-Findmod</a></div><p>Predict potential protein post-translational modifications and find potential single amino acid substitutions in peptides.</p></div><div><div><a href="http://mbs.cbrc.jp/EzCatDB/">EzCatDB -- the Enzyme Catalytic-mechanism Database</a></div><p>Search for information related to the catalytic mechanisms of enzymes.</p></div><div><div><a href="http://bioinf.cs.ucl.ac.uk/ffpred/">FFPred -- feature-based function prediction</a></div><p>An integrated feature-based function prediction server for vertebrate proteomes.</p></div><div><div><a href="http://www.ebi.ac.uk/printsscan/">FingerPRINT Scan</a></div><p>Identify the closest matching PRINTS sequence motif fingerprints in a protein sequence.</p></div><div><div><a href="http://firedb.bioinfo.cnio.es/">FireDB -- a database of functionally important residues from proteins of known structure</a></div><p>Search for functional annotation of important sites in proteins with known structures.</p></div><div><div><a href="http://bioserv.rpbs.univ-paris-diderot.fr/cgi-bin/Frog2">Frog2 -- a FRee Online druG 3D conformation generator</a></div><p>Produce 3D conformations of small drug compounds.</p></div><div><div><a href="http://www.hgpd.jp/">HGPD -- Human Gene and Protein Database</a></div><p>A database presenting experiment-based results in human proteomics.</p></div><div><div><a href="http://hhsenser.tuebingen.mpg.de/">HHsenser -- exhaustive transitive profile search using HMMx96HMM comparison</a></div><p>Conduct exhaustive intermediate profile searches of a set of homologous protein sequences.</p></div><div><div><a href="http://loschmidt.chemi.muni.cz/hotspotwizard/">HotSpot Wizard -- Substrate Specificity Hot Spot Identification web server</a></div><p>Design protein mutations in site-directed mutagenesis.</p></div><div><div><a href="http://phylogenomics.berkeley.edu/intrepid/">INTREPID -- INformation-theoretic TREe traversal for Protein functional site IDentification</a></div><p>Use for protein functional site identification.</p></div><div><div><a href="http://www.cbs.dtu.dk/">Integrating protein annotation resources through the Distributed Annotation System</a></div><p>Annotate protein using this integrated annotation resource.</p></div><div><div><a href="http://www.ebi.ac.uk/InterProScan/">InterProScan -- protein domains identifier</a></div><p>Identify protein family (and DNA) domains, patterns, motifs, protein families, and functional sites.</p></div><div><div><a href="http://kfc.mitchell-lab.org/">KFC -- Knowledge-based FADE and Contacts</a></div><p>Interactive forecasting of protein interaction hot spots.</p></div><div><div><a href="http://biominer.bime.ntu.edu.tw/magiicpro/">MAGIIC-PRO -- detecting functional signatures by efficient discovery of long patterns in protein sequences</a></div><p>Discover long patterns in protein sequences.</p></div><div><div><a href="http://prodata.swmed.edu/malisam">MALISAM -- Manual ALIgnments for Structurally Analogous Motifs</a></div><p>Database containing pairs of structural analogs and their alignments.</p></div><div><div><a href="http://meme.nbcr.net/">MEME -- discovering and analyzing DNA and protein sequence motifs</a></div><p>Find sequence patterns in DNA and protein sequences.</p></div><div><div><a href="http://www.nii.res.in/modpropep.html">MODPROPEP -- a program for knowledge-based modeling of protein-peptide complexes</a></div><p>A web server for knowledge-based modeling of protein-peptide complexes, specifically peptides in complex with major histocompatibility complex (MHC) proteins and kinases.</p></div><div><div><a href="http://www.bioinfo.tsinghua.edu.cn/~tigerchen/memo.html">MeMo -- a web tool for prediction of protein methylation modifications</a></div><p>Predict protein methylation sites.</p></div><div><div><a href="http://caps.ncbs.res.in/MegaMotifbase/index.html">MegaMotifBase -- a database of structural motifs in protein families and superfamilies</a></div><p>Find structural segments or motifs for protein structures.</p></div><div><div><a href="http://mnm.engr.uconn.edu/MNM/SMSSearchServlet">Minimotif Miner -- a tool for investigating protein function</a></div><p>Find motifs in a protein sequence.</p></div><div><div><a href="http://umber.sbs.man.ac.uk/dbbrowser/motif3d/motif3d.html">Motif3D -- Relating protein sequence motifs to 3D structure</a></div><p>Visualize protein sequence motifs on the 3D protein structures.</p></div><div><div><a href="http://myhits.isb-sib.ch/cgi-bin/motif_scan">MotifScan</a></div><p>Find presence of any known protein motif (Prosite and Pfam) in a protein sequence.</p></div><div><div><a href="http://bioinfo3d.cs.tau.ac.il/MultiBind">MultiBind -- Multiple Alignment of Protein Binding Sites</a></div><p>Recognize spatial chemical binding patterns common to a set of protein structures.</p></div><div><div><a href="http://mendel.imp.univie.ac.at/myristate/SUPLpredictor.htm">NMT -- The MYR Predictor</a></div><p>Analyze proteins for the presence of N-terminal N-myristoylation site.</p></div><div><div><a href="http://www.cbs.dtu.dk/services/NetNGlyc/">NetNGlyc -- N-Glycosylation sites prediction tool</a></div><p>Find the presence of N-Glycosylation sites in human proteins.</p></div><div><div><a href="http://www.cbs.dtu.dk/services/NetOGlyc/">NetOGly 3.1 -- O-glycosylation sites prediction tool</a></div><p>Find the presence of O-GalNAc (mucin type) glycosylation sites in mammalian proteins.</p></div><div><div><a href="http://www.cbs.dtu.dk/services/NetPhos/">NetPhos 2.0 -- Phosphorylation sites predictions</a></div><p>Analyze eukaryotic proteins for the presence of serine, threonine and tyrosine phosphorylation sites.</p></div><div><div><a href="http://www.cbs.dtu.dk/services/NetPhosK/">NetPhosK 1.0 Server -- kinase specific eukaryotic protein phosphorylation sites prediction tool</a></div><p>Find possible kinase specific phosphorylation sites in eukaryotic proteins.</p></div><div><div><a href="http://networkin.info/search.php">NetworKIN -- a resource for exploring cellular phosphorylation networks</a></div><div>&nbsp;</div></div><div><div><a href="http://neuroproteomics.scs.uiuc.edu/neuropred.html">NeuroPred -- a tool to predict cleavage sites in neuropeptide precursors and provide the masses of the resulting peptides</a></div><p>Predict cleavage sites at basic amino acid locations in neuropeptide precursor sequences.</p></div><div><div><a href="http://www.ebi.ac.uk/patentdata/nr/">Non-Redundant Patent Sequences - Patented Sequence Database</a></div><p>Find information about patented nucleotide and protein sequences.</p></div><div><div><a href="http://www.cbs.dtu.dk/databases/OGLYCBASE/">O-GLYCBASE</a></div><p>Search for information about glycoproteins with O-linked and C-linked glycosylation sites.</p></div><div><div><a href="http://www.pandora.cs.huji.ac.il/">PANDORA -- Protein ANnotation Diagram ORiented Analysis</a></div><p>Find information about protein sequence annotations.</p></div><div><div><a href="http://sunserver.cdfd.org.in:8080/protease/PAR_3D/index.html">PAR-3D -- Protein Active site Residue - 3D structural motif</a></div><p>A server to predict protein active site residues.</p></div><div><div><a href="http://wwwmgs.bionet.nsc.ru/mgs/gnw/pdbsite/">PDBSite -- a database of the 3D structure of protein functional sites</a></div><p>Search for structural and functional information on the protein functional sites.</p></div><div><div><a href="http://wwwmgs.bionet.nsc.ru/mgs/systems/fastprot/pdbsitescan.html">PDBSiteScan -- A program for searching for active, binding and posttranslational modification sites in the 3D structures of proteins</a></div><p>Search 3D protein fragments similar in structure to known active, binding and posttranslational modification sites.</p></div><div><div><a href="http://pedant.gsf.de/">PEDANT -- Protein Extraction, Description and ANalysis Tool</a></div><p>Conduct genome wide functional and structural analysis.</p></div><div><div><a href="http://phosida.org/">PHOSIDA -- Phosphorylation site database</a></div><p>Search for phosphorylation data of any protein of interest.</p></div><div><div><a href="http://www.phosphorylation.biochem.vt.edu/">PHOSPHORYLATION SITE DATABASE</a></div><p>Search for information on prokaryotic proteins that undergo serine, threonine, or tyrosine phosphorylation.</p></div><div><div><a href="http://www.jcvi.org/pn-utility/web/smarty_wrapper/about.php">PNU -- Protein Naming Utility</a></div><p>Determine correct names for proteins.</p></div><div><div><a href="http://mbs.cbrc.jp/poodle/poodle-s.html">POODLE-S -- Predicition Of Order and Disorder by machine LEarning</a></div><p>Web application for predicting protein disorder by using physicochemical features and reduced amino acid set of a position-specific scoring matrix.</p></div><div><div><a href="http://gemdock.life.nctu.edu.tw/ppisearch/">PPISearch -- Protein-Protein Interaction Search</a></div><p>Find homologous protein-protein interactions across multiple species.</p></div><div><div><a href="http://www.ebi.ac.uk/ppsearch/">PPSearch</a></div><p>Search your query sequence against PROSITE pattern database for protein motifs.</p></div><div><div><a href="http://pridb.gdcb.iastate.edu/">PRIDB -- Protein-RNA Interface DataBase</a></div><p>Find information about protein-RNA complexes from the Protein Data Bank (PDB).</p></div><div><div><a href="http://umber.sbs.man.ac.uk/dbbrowser/PRINTS/">PRINTS and its automatic supplement, prePRINTS -- A compendium of protein fingerprints</a></div><p>Search for protein fingerprints.</p></div><div><div><a href="http://www.expasy.org/prosite/">PROSITE</a></div><p>Identify protein families and domains for a given protein sequence.</p></div><div><div><a href="http://www.imtech.res.in/raghava/prrdb/">PRRDB -- Pattern Recognition Receptor Database</a></div><p>A comprehensive database of pattern-recognition receptors and their ligands.</p></div><div><div><a href="http://www.arabidopsis.org/cgi-bin/patmatch/nph-patmatch.pl">PatMatch -- a program for finding patterns in peptide and nucleotide sequences</a></div><p>Search for short nucleotide or peptide sequences such as cis-elements in nucleotide sequences or small domains and motifs in protein sequences.</p></div><div><div><a href="http://pepcyber.umn.edu/PPEP/">PepCyber:P~PEP -- a database of human protein protein interactions mediated by phosphoprotein-binding domains</a></div><p>Database specialized in documenting human PPBD-containing proteins and PPBD-mediated interactions.</p></div><div><div><a href="http://us.expasy.org/tools/peptidecutter/">PeptideCutter -- protein cleavage sites prediction tool</a></div><p>Predicts potential protease cleavage sites and sites cleaved by chemicals in a given protein sequence.</p></div><div><div><a href="http://phobius.binf.ku.dk/">Phobius -- A combined transmembrane topology and signal peptide predictor</a></div><p>Predict combined transmembrane topology and signal peptides.</p></div><div><div><a href="http://phospho.elm.eu.org/">Phospho.ELM -- a database of phosphorylation sites</a></div><p>Search for eukaryotic phosphorylation sites.</p></div><div><div><a href="http://www.phospho3d.org/">Phospho3D -- a database of three-dimensional structures of protein phosphorylation sites</a></div><p>Search for 3D structure and functional annotation of phosphorylation sites in proteins.</p></div><div><div><a href="http://www.phosphosite.org/">PhosphoSite -- A bioinformatics resource dedicated to physiological protein phosphorylation.</a></div><p>Search the database of in vivo phosphorylation sites of human and mouse proteins</p></div><div><div><a href="http://pxgrid.med.monash.edu.au/polyq/">PolyQ -- Polyglutamine Database</a></div><p>Find information about polyglutamine (polyQ) repeats.</p></div><div><div><a href="http://www.ebi.ac.uk/pratt/">Pratt Protein motif and pattern discovery</a></div><p>Find the presence of protein motifs and patterns in an amino acid sequence.</p></div><div><div><a href="http://www.predisi.de/">PrediSi -- Prediction of Signal Peptides and their Cleavage Positions</a></div><p>Predict signal peptide sequences and their cleavage positions in bacterial and eukaryotic amino acid sequences.</p></div><div><div><a href="http://www.ebi.ac.uk/thornton-srv/databases/ProFunc/">ProFunc -- a server for predicting protein function from 3D structure</a></div><p>Predict protein functions based on known structures.</p></div><div><div><a href="http://bioinfo41.weizmann.ac.il/promate/promateus.html">ProMateus--an open research approach to protein-binding sites analysis</a></div><p>Predict the location of potential protein-protein binding sites for unbound proteins.</p></div><div><div><a href="http://www.proteus.cs.huji.ac.il/">ProTeus -- identifying signatures in protein termini</a></div><p>Identify short linear signatures in protein termini.</p></div><div><div><a href="http://genius.embnet.dkfz-heidelberg.de/menu/cgi-bin/w2h-open/w2h.open/w2h.startthis?SIMGO=w2h%2ewelcome">ProtSweep -- protein annotation by homology</a></div><p>Analyze and identify newly obtained protein sequences.</p></div><div><div><a href="http://protemot.csbb.ntu.edu.tw/">Protemot -- prediction of protein binding sites with automatically extracted geometrical templates</a></div><p>Predict protein binding sites in a protein sequence based on geometrical analysis of protein tertiary substructures.</p></div><div><div><a href="http://quasimotifinder.tau.ac.il/">QuasiMotiFinder -- protein annotation by searching for evolutionarily conserved motif-like patterns</a></div><p>Search for evolutionarily conserved motif-like patterns in protein sequences.</p></div><div><div><a href="http://bindr.gdcb.iastate.edu/RNABindR">RNABindR -- software for prediction of RNA binding residues in proteins</a></div><p>Web-based server for analyzing and predicting RNA binding sites in proteins.</p></div><div><div><a href="http://caps.ncbs.res.in/scanmot/scanmot.html">SCANMOT -- searching for similar sequences using a simultaneous scan of multiple sequence motifs</a></div><p>Search for similarities between proteins by simultaneous matching of multiple motifs.</p></div><div><div><a href="http://bioinf.fbb.msu.ru/SDPpred/">SDPpred -- A Tool for Prediction of Amino Acid Residues that Determine Differences in Functional Specificity of Homologous Proteins</a></div><p>Predict residues in protein sequences that determine the proteins' functional specificity.</p></div><div><div><a href="http://tamm.mit.edu/SDR/">SDR -- Specificity Determining Residues Database</a></div><p>Predict specificity-determining residues in protein families.</p></div><div><div><a href="http://bioware.ucd.ie/~slimdisc/">SLiMDisc -- Short, Linear Motif Discovery</a></div><p>Find shared motifs in proteins with a common attribute.</p></div><div><div><a href="http://sumosp.biocuckoo.org/">SUMOsp -- a web server for sumoylation site prediction</a></div><p>Conduct in silico sumoylation sites prediction.</p></div><div><div><a href="http://oxytricha.princeton.edu/SWAKK/">SWAKK -- a web server for detecting positive selection in proteins using a sliding window substitution rate analysis</a></div><p>Detect protein sequence section under positive evolution selection.</p></div><div><div><a href="http://www.expasy.org/tools/scanprosite/">ScanProsite</a></div><p>Search for motifs and patterns within protein sequences.</p></div><div><div><a href="http://www.expasy.org/tools/scanprosite/">ScanProsite -- detection of PROSITE signature matches and ProRule-associated functional and structural residues in proteins</a></div><p>Detect patterns, profiles and motifs in a protein sequence.</p></div><div><div><a href="http://scansite.mit.edu/">ScanSite 2.0 -- Proteome-wide prediction of cell signaling interactions using short sequence motifs</a></div><p>Search for motifs within proteins that are likely to be phosphorylated by specific protein kinases or bind to domains such as SH2 domains, 14-3-3 domains or PDZ domains.</p></div><div><div><a href="http://sepresa.bio-x.cn/">SePreSA -- SErver for the PREdiction of populations susceptible to Serious Adverse drug reaction</a></div><p>Find information about populations carrying polymorphisms within protein binding pockets that make them susceptible to serious adverse drug reaction (SADR).</p></div><div><div><a href="http://motif.genome.jp/">Sequence Motif Search</a></div><p>Search the presence of a motif in either amino acid sequence or nucleotide sequence.</p></div><div><div><a href="http://www.csbio.sjtu.edu.cn/bioinf/Signal-3L/">Signal-3L -- A 3-layer approach for predicting signal peptides</a></div><p>Predict signal peptides.</p></div><div><div><a href="http://www.cbs.dtu.dk/services/SignalP/">SignalP -- Machine learning approaches to the prediction of signal peptides, their cleavage sites, and other protein sorting signals</a></div><p>Predict signal peptides and their cleavage sites.</p></div><div><div><a href="http://us.expasy.org/tools/sulfinator/">Sulfinator -- tyrosine sulfation sites prediction tool</a></div><p>Predict the presence of tyrosine sulfation sites in protein sequences</p></div><div><div><a href="http://bioinf-services.charite.de/supersite/">SuperSite -- Ligand Binding Site Database</a></div><p>Look at protein structure from a ligand and binding site perspective.</p></div><div><div><a href="http://www.ch.embnet.org/">Swiss EMBnet node web server</a></div><p>Use a collection of bioinformatics tools at this portal site.</p></div><div><div><a href="http://bioinfo.montp.cnrs.fr/?r=t-reks">T-REKS -- identification of Tandem REpeats in sequences with a K-meanS based algorithm</a></div><p>Find information about tandem repeats in proteins that carry fundamental biological functions and are related to a number of human diseases.</p></div><div><div><a href="http://tmbeta-genome.cbrc.jp/TMFunction/">TMFunction -- The Functional Database of Membrane Proteins</a></div><p>Find information about functional residues in alpha-helical and beta-barrel membrane proteins.</p></div><div><div><a href="http://topdom.enzim.hu/">TOPDOM -- Conservatively Located Domains and Motifs in Transmembrane Proteins</a></div><p>Database of domains and motifs with conservative location in transmembrane proteins.</p></div><div><div><a href="http://motif.stanford.edu/distributions/emotif/">The EMOTIF database</a></div><p>Search for highly conserved and specific protein sequence motifs.</p></div><div><div><a href="http://treedetv2.bioinfo.cnio.es/treedet/index.html">TreeDet -- Predicting Functional Residues in Protein Sequence Alignments</a></div><p>Predict functional sites in protein sequence alignments use different methodologies.</p></div><div><div><a href="http://motif.bmi.ohio-state.edu/ChIPMotifs/">W-ChIPMotifs -- ChIP-based protein Motif discovery web server</a></div><p>Find de novo protein motifs from chromatin immunoprecipitation data.</p></div><div><div><a href="http://feature.stanford.edu/webfeature/">WebFEATURE -- an interactive web tool for identifying and visualizing functional sites on macromolecular structures</a></div><p>Scan query structures for functional sites in both proteins and nucleic acids.</p></div><div><div><a href="http://wwwmgs.bionet.nsc.ru/mgs/programs/panalyst/">WebProAnalyst -- an interactive tool for analysis of quantitative structurex96activity relationships in protein families</a></div><p>Analyze quantitative structure-activity relationship of related protein families.</p></div><div><div><a href="http://motif.stanford.edu/distributions/eblocks/">eBLOCKs -- enumerating conserved protein blocks to achieve maximal sensitivity and specificity</a></div><p>Search for ungapped alignments of highly conserved regions among a protein family or superfamily.</p></div><div><div><a href="http://ef-site.hgc.jp/eF-seek/">eF-seek -- prediction of the functional sites of proteins by searching for similar electrostatic potential and molecular surface shape</a></div><p>Predict the functional sites of proteins.</p></div><div><div><a href="http://firedb.bioinfo.cnio.es/Php/FireStar.php">firestar -- prediction of functionally important residues using structural templates and alignment reliability</a></div><p>An expert system for predicting ligand-binding residues in protein structures.</p></div><div><div><a href="http://caps.ncbs.res.in/imotdb/">iMOTdb -- a comprehensive collection of spatially interacting motifs in proteins</a></div><p>Automatically identify spatially interacting motifs among distantly related proteins sharing similar folds and possessing common ancestral lineage.</p></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</guid>
	<pubDate>Thu, 23 Jul 2020 05:49:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</link>
	<title><![CDATA[wgd—simple command line tools for the analysis of ancient whole-genome duplications]]></title>
	<description><![CDATA[<p><span>wgd is a easy to use command-line tool for<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>distribution construction named wgd. The wgd suite provides commonly used<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>and colinearity analysis workflows together with tools for modeling and visualization, rendering these analyses accessible to genomics researchers in a convenient manner.</span></p>
<p><a href="https://academic.oup.com/bioinformatics/article/35/12/2153/5162749">https://academic.oup.com/bioinformatics/article/35/12/2153/5162749</a></p><p>Address of the bookmark: <a href="https://github.com/arzwa/wgd" rel="nofollow">https://github.com/arzwa/wgd</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/21257/bioinformatics-phds-cover-letter</guid>
	<pubDate>Mon, 16 Feb 2015 12:48:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/21257/bioinformatics-phds-cover-letter</link>
	<title><![CDATA[Bioinformatics PhDs - Cover Letter]]></title>
	<description><![CDATA[<p><strong>Overview</strong><br />The reception your cover letter will receive is more varied and unpredictable than the other elements of your application packet.&nbsp; Some readers, especially at large research universities, will skip it entirely, and focus instead on more direct indicators of your academic achievements and potential: the CV, letters, and writing sample.&nbsp; Most often, however, your cover letter works in tandem with your CV, and represents your best opportunity to communicate directly with your target audience prior to an interview.<br /><br />The cover letter should not simply repeat the information contained in the CV; rather it should elaborate and frame the aspects of your academic training and background that you want search committee members to have uppermost in their minds as they consider your candidacy.&nbsp; At a minimum, it should contain a clear statement of your research and teaching interests, and how your qualifications match the requirements of the job description. Many disciplines have their own conventions and protocols for application materials including the cover letter. Be sure to show a draft of your letter to your chair or the department's placement advisor.<br /><br />There is no perfect or even preferred style of cover letter save that tone should be that of a confident professional.&nbsp; Departments aren't interested in hiring graduate students (they already have enough of those).&nbsp; They are looking for serious scholars/teachers who will make interesting, congenial, and productive colleagues. While it is probably not a good use of your time to tailor your letter for each opening, you will probably need at least two base versions that emphasize different elements (You would not want to use the same cover letter to apply to Oberlin as UC Irvine). You may want to customize the letters for the three to five jobs most attractive to you.<br /><br />Your cover letter should not exceed a page and a half or two at the most.&nbsp; No one will read a four-page letter, and your apparent inability to communicate your credentials in a concise manner is not to your advantage. Every line of your letter should serve a demonstrable purpose. Some people have gotten excellent jobs with a brief, boilerplate letter containing no more than a short intro, a paragraph on their research, and a couple of sentences on their teaching. Others use letters that discuss in very specific terms how they, their research, and their teaching would "fit" within the existing department and institutional setting. The choice of style is up to you, and should reflect what makes you feel most comfortable and most positive about your credentials.<br /><br />There are, however, circumstances where a longer, more annotated version is more likely to be helpful. The issues you should take into account when making this decision are:<br /><br />&nbsp;&nbsp;&nbsp; The size of the department/institution<br />&nbsp;&nbsp;&nbsp; The extent to which your research is mainstream and its significance readily apparent<br />&nbsp;&nbsp;&nbsp; The extent to which your qualifications diverge from those mentioned in the job ad<br />&nbsp;&nbsp;&nbsp; The extent to which the institution to which you are applying differs from UC Berkeley and the relative importance of teaching versus research<br />&nbsp;&nbsp;&nbsp; Unusual circumstances or career paths<br /><br />Size matters. The larger the department, the less detailed your letter needs to be.&nbsp; If there are already six people working in your sub-field, they can assess and translate the significance of your work to others in the department.&nbsp; If, however, you will be the only history of science person or the only physical anthropologist in the department, the search committee and others will likely need more help from you to understand the import of your work.&nbsp; Remember, if they are searching for your specialty they are understaffed in your area, and even if there is more than one person in your sub-field she/he may be on leave or otherwise uninvolved in the search.<br /><br />Similarly, smaller departments are more likely to be concerned than larger ones about the specific courses you are prepared to teach.&nbsp; If there are certain core courses your position needs to cover, make it unambiguously clear that you are prepared to do so even if you haven't taught them already.<br /><br />As a rule of thumb, the more your profile diverges from the specifics of the job description (or the norm, such that it exists), the more likely you will want to say more about why you are nonetheless a strong candidate.&nbsp; By doing so you can turn a question mark into an advantage.&nbsp; Highlight your strengths, and if you have time perform a little research on the department (see below) so you can explain how you would add to the department in ways that they might otherwise not have considered.&nbsp; Job descriptions are not always etched in stone. If you're very interested in the job, call the department and ask to speak to someone on the search committee.&nbsp; If that's too intimidating, call the departmental assistant or secretary. They can at least tell you if it&rsquo;s a new position or replacement which in turn can indicate whether they really need someone who can teach The Politics of Southern Africa or if Middle Eastern Politics would do just as well.&nbsp; They may well be willing to sacrifice a course in an area that the ad specified in order to get the extra teaching experience or innovative research that you have to offer, but only if you give them the opportunity and explain what they'd get in return.<br /><br />&nbsp;If you've taken an unusually long time to finish because you spent three years learning a new language in order to prepare for two years of original research or some other factor that enriches what you have to offer as a teacher or a scholar, let them know about it.&nbsp; Learning a new language, for example, is an indicator of your commitment to serious scholarship.&nbsp; Think of a way to put a positive valence on an aspect of your CV that you believe is likely to raise questions or doubts.<br /><br />As hard as it may be for not-yet-employed-but-soon-to-be academics like yourselves to believe, there are some individuals and departments that are intimidated by you and your institutional pedigree.&nbsp; There are many fine schools and departments that are convinced that every Berkeley graduate student is only interested in a position at Harvard, Princeton, or (hold your nose) Stanford.&nbsp; If it is a small liberal arts college, they may also assume that you view teaching and advising undergraduates strictly as a necessary evil. Ergo, why interview someone who will either look down their nose at us, and/or desert us for greener pastures as soon as their third book has been published and Yale comes calling.&nbsp; They often don't seem to realize that Berkeley graduate students are sincerely interested in a wide range of academic settings for a variety of reasons personal and professional, and, perhaps more to the point, Yale rarely "comes calling."&nbsp; An even greater burden of proof exists if a quick scan of your CV reveals that your all of your experience in higher education has occurred in a large, elite, research-oriented setting. How can you overcome this potential obstacle especially if you're very interested in a school that you have reason to believe may be suspicious of Berkeley PhDs?<br /><br />It's probably not advisable to write in a cover letter that they shouldn't be intimidated by lil' old you (i.e., "I'm really not very good; in fact, my advisor says I'm her worst graduate student in twenty years."), but there are ways to indicate a sincere interest in their department.&nbsp; One means is to do a little research, and briefly discuss how you might fit into the department and the institutional community-at-large.&nbsp; There are numerous articles written by faculty about the search process that state explicitly the positive impact it can have on their impression of a candidate to see evidence that that he/she has taken the time to learn something about them. Researching a department and its associated programs/research centers has never been easier.&nbsp; Virtually all colleges and universities are online, and their web addresses can be easily located using Education/Universities link.<br /><br />A second way to address fears of imminent flight is to provide evidence of ties to the area, the university, or lifestyle.&nbsp;&nbsp; If you are from the Midwest, have family nearby, or even if you just spent an enjoyable summer there, add a line about it and your desire to return to your cover letter for Purdue or Wayne State.&nbsp; If you did your undergraduate work at a similar type of institution, draw their attention to that link.&nbsp; Don't assume that they will notice where you got your BA on your CV, and make the connection.<br /><br />If you are applying to small, liberal arts colleges, don't just list the courses you've taught with a line of boilerplate about how important you take your teaching responsibilities to be. These days, a good, small college has a list price of about $30,000 a year, and close contact with people like you is one of their key selling points to parents and potential students. You are expected to be more than a lecturer, and your ability to convey your recognition of that fact and a sincere interest in working closely with students matters. Advising, participating in non-academic activities, watching your students grow and mature inside the classroom and out (and having an influence on that process) can be among the most rewarding aspects of the profession.&nbsp; If you value these broader elements of being a professor, let them know. In particular, if your own experience has been limited to large universities, think about describing an episode where you had a positive impact on the development of a student and the satisfaction you derived from helping him or her. At many small colleges, and large universities (including Berkeley) as well, one of the most significant pedagogical trends is fostering greater student involvement in faculty research.&nbsp; If you can articulate how this might occur for you and their students in a brief but thoughtful manner, it can alleviate some of the concerns occasioned by your Berkeley background.<br /><br />Your letter typically will have four segments: the introduction, research, teaching, and the closing.<br /><br /><strong>Introduction</strong><br />Be sure to identify the position you are applying for by rank and sub-field in the first sentence or two.&nbsp; It is not uncommon for departments to be engaged in more than one search in a given year, and large departments may have more than one in your sub-field.&nbsp; If it is an open rank position and you are applying as an assistant professor, in most cases you and your record of accomplishments will not be directly compared with those of more experienced candidates applying for it at the associate or full professor level.&nbsp; Rather, applicants are assessed based on where they are in their career path, and you have every chance of successfully competing against them.<br /><br />If you have finished, mention it up front. If not, state when you expect to file - no later than June 2003.&nbsp; Many readers will view your optimistic prediction with a skeptical eye, and anything you can say that makes the claim appear more credible (e.g., "I have written and my chair has reviewed four of the six chapters.") can help mitigate their concerns.&nbsp; You can put such a statement in the introduction or wait until you discuss the dissertation itself.<br /><br />If your discipline holds its annual meeting in the summer or early fall (i.e., before application deadlines) and you had an excellent conference interview, make reference to it in the cover letter including the names of the faculty with whom you spoke.&nbsp; By the time people actually start to read files, months may have passed and even the strongest of impressions can fade.&nbsp; But they can be rehabilitated and revived, especially if you can remind them of a specific strength, ability, or issue that seemed particularly salient during the interview.<br />Research<br />Unless you are applying to a school that cares only about your teaching (increasingly rare), a description of your research generally follows next.&nbsp; The challenge here is not simply to describe your research, but to frame it in terms of your sub-field and discipline. The search committee, hasn't lived, eaten and breathed Post-Edwardian Hermeneutics for the past five years the way you have. And they haven't been there every step of the torturous process like your friends and significant others. So forgive them for not immediately recognizing your research at first blush for the path-breaking work that it is.<br /><br />Departments want to know that in hiring you, they are adding someone who will make a future contribution to the discipline and enhance the reputation of the department. However, they are often ill-equipped to understand exactly how that will be true in your particular case. Many disciplines are sufficiently broad that leading or cutting-edge research in one sub-field is barely intelligible to those in others.&nbsp; In addition, when you became a candidate for the short list, your file will be read by department members outside your specialty, and, oftentimes later on in the process, by individuals outside your discipline as well. You need to describe the forest in which your tree resides, and explain why it matters in terms of the broader trends and issues within your discipline. Obviously, if your work is focused on one of the classic conundrums of your field, much less in the way of providing perspective is necessary than if you are addressing an emergent issue or employing an unconventional approach.<br /><br />If your research is particularly novel or cutting-edge, any markers of broader acceptance by other, more established scholars or scholarly organs in your field can ameliorate possible concerns about its relevance and potential importance.&nbsp; In discussing your work, note the recognition it has received in the form of competitive grants, awards, publications in refereed journals, and/or presentations at major conferences.<br /><br />It is also important to mention where you expect your research to go after the completion of your dissertation and the publications that will flow from it.&nbsp; They, especially at research-oriented institutions, want to know at least in broad terms where you expect to go from here.&nbsp; They want to see evidence of a scholarly agenda that extends beyond the dissertation.&nbsp; You don't need to have pages written or titles blocked out, but you need to tell them in a paragraph, (two at the most) about what questions intrigue you, and how you expect to go about finding the answers to them.&nbsp; These questions for future research may have been generated by the findings of your dissertation, unusual data uncovered during your fieldwork, or interesting side issues that you were forced to put off in order to keep your dissertation taut and focused.&nbsp; Think twice about mentioning future projects that appear entirely unrelated to your current work. Departments will want you to be firmly established in one area before you go off into another.<br /><br />The relative importance of teaching versus research is a continuous and not a discrete variable.&nbsp; Even schools that emphasize teaching in their job listing will generally want evidence of scholarly engagement and publishing potential. It is a very competitive market for students out there, and virtually all institutions are under pressure to sell themselves via the quality of their faculty to the limited number of good students in the applicant pool.&nbsp; A good marker for the relative importance of teaching versus research is the teaching load.&nbsp; An institution with a 3-2 teaching load (a total of five courses taught per two-semester year) will expect more in the way of and value research more highly than one with a 3-3 load.<br /><br />If you work in a capital-intensive area, mention your track record of gaining grants and other sources of external funding.<br /><strong>Teaching</strong><br />In a similar fashion, the more the institution you are applying to diverges from Berkeley and the more your profile differs from the job description, the more expansive you should be in talking about your teaching and what you have to offer their students.&nbsp; If you have won a teaching award at Berkeley, don't make them wait until they read your CV to discover that fact.<br /><br />For letters sent to large universities where you will be expected to teach large, lecture courses and graduate seminars, little is needed except to convey that you have the necessary experience and/or background.&nbsp; Since the dominant pedagogical style is the same as that found at Berkeley, it will be assumed that you will be able to do the same for them.<br /><br />If you have TA'd some of the courses that (based on the job description) you would be expected to offer, let them know.&nbsp; If you have not had that opportunity, but your fields and research fall within the domain of the job description, you may want to add a line about how well prepared you are to teach such courses based on your training and research.<br /><br />If your profile does not correspond exactly to the description found in the job announcement, but you believe that you could nonetheless teach the required courses, explain the basis for your confidence. What strength would you bring to the department that would more than make up for your "otherness"?&nbsp; Departments may decide that they don't "need" another conventional European historian if you can convince them that you can handle the core courses and offer something new that they don't currently cover as well. In this case especially, think about doing some research so you can speak in more specific terms about how you would fit into and enhance the department's offerings. Help them visualize how you would strengthen them as a department.<br /><br />Small colleges will want to know that you are able to teach on a more intimate basis and are prepared to take the time to do it well. If you give them three generic lines about how "important" you consider your teaching responsibilities, don't expect much of a positive response.&nbsp; Spend a couple of paragraphs describing your teaching experience and philosophy, and how you would take advantage of the opportunity to create you own courses.<br /><br />If you've had the opportunity to design and teach your own course, tell them, briefly, how you went about it and the choices you made. Don't just say you're a good teacher, tell them why. Look over your teaching evaluations and pick out one or two consistent strengths to highlight. Drawing on your experience, talk about how you engage students and enhance their skills (especially writing) and intellectual development.<br /><br />For good, small colleges, the quality of the teaching offered to students is their stock-in- trade.&nbsp; Even the most research-oriented, small colleges take teaching undergraduates very seriously. You need to demonstrate that you take it seriously as well, and can talk about it using more than vague generalities and shop-worn cliches.<br />Closing/Enclosures<br />Wrap it up quickly.&nbsp; If you are going to be traveling for any significant portion of the job search season be sure to let them know how they can contact you (email, cellphone and/or a Pacific Bell message center account are particularly good options).<br /><br />Before closing, include a sentence where you list the materials you have enclosed (e.g., CV, dissertation abstract, transcripts, teaching statement/portfolio, writing samples, etc.) and are having sent separately (letters of recommendation).&nbsp; You will often be assembling multiple packets at the same time (as in midnight October 14th, midnight November 14th, etc.) for jobs that ask for different combinations of enclosures.&nbsp; In addition to telling them what they should have received, it serves as a handy list for you to check before sealing the envelope.<br /><br />Should you send a writing sample, even if they haven't asked for one? Unless the norm in your discipline is to never send more than they ask for, if you've been smart and have already run off thirty copies at two cents per page (that's only sixty cents for a thirty page chapter) by all means send it.&nbsp; That way it's in the file should someone become interested in you and want to read more.</p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>

</channel>
</rss>