<?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/2261?offset=1140</link>
	<atom:link href="https://bioinformaticsonline.com/related/2261?offset=1140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</guid>
	<pubDate>Thu, 13 Feb 2020 00:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</link>
	<title><![CDATA[genomics public data links !]]></title>
	<description><![CDATA[<p>List of publically available databases on google server.</p>
<p>More at <a href="https://software.broadinstitute.org/gatk/download/bundle">https://software.broadinstitute.org/gatk/download/bundle</a></p>
<p><a href="ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/">ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/</a>.</p>
<p><a href="ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/">ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/</a></p><p>Address of the bookmark: <a href="https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1" rel="nofollow">https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</guid>
	<pubDate>Thu, 26 Aug 2021 10:28:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</link>
	<title><![CDATA[k-mers tutorial - classification and taxonomy]]></title>
	<description><![CDATA[<p>DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to&nbsp;<a href="http://www.pnas.org/content/109/33/13272">store k-mer graphs efficiently</a>,&nbsp;<a href="http://ivory.idyll.org/blog/what-is-diginorm.html">discard redundant data</a>, and&nbsp;<a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0101271">count them efficiently</a>.</p>
<p>More recently, we've been enthused about&nbsp;<a href="http://joss.theoj.org/papers/3d793c6e7db683bee7c03377a4a7f3c9">using k-mer based similarity measures</a>&nbsp;and&nbsp;<a href="http://ivory.idyll.org/blog/2016-sourmash-sbt.html">computing and searching k-mer-based sketch search databases for all the things</a>.</p>
<p>But I haven't spent too much talking about using k-mers for taxonomy, although that has become an&nbsp;<em>ahem</em>&nbsp;area of interest recently,&nbsp;<a href="http://www.biorxiv.org/content/early/2017/07/03/155358">if you read into our papers a bit</a>.</p>
<p>In this blog post I'm going to fix this by doing a little bit of a literature review and waxing enthusiastic about other people's work. Then in a future blog post I'll talk about how we're building off of this work in fun! and interesting? ways!</p><p>Address of the bookmark: <a href="http://ivory.idyll.org/blog/2017-something-about-kmers.html" rel="nofollow">http://ivory.idyll.org/blog/2017-something-about-kmers.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43916/understanding-dump-files-from-ncbi-taxonomy-database</guid>
	<pubDate>Fri, 15 Jul 2022 04:29:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43916/understanding-dump-files-from-ncbi-taxonomy-database</link>
	<title><![CDATA[Understanding DUMP files from NCBI Taxonomy database !]]></title>
	<description><![CDATA[<p>*.dmp files are bcp-like dump from GenBank taxonomy database</p><p>General information.</p><p>Field terminator is "\t|\t"</p><p>Row terminator is "\t|\n"</p><p>&nbsp;</p><p>nodes.dmp file consists of taxonomy nodes. The description for each node includes the following</p><p>fields:</p><p>tax_id -- node id in GenBank taxonomy database</p><p>&nbsp; parent tax_id -- parent node id in GenBank taxonomy database</p><p>&nbsp; rank -- rank of this node (superkingdom, kingdom, ...)&nbsp;</p><p>&nbsp; embl code -- locus-name prefix; not unique</p><p>&nbsp; division id -- see division.dmp file</p><p>&nbsp; inherited div flag&nbsp; (1 or 0) -- 1 if node inherits division from parent</p><p>&nbsp; genetic code id -- see gencode.dmp file</p><p>&nbsp; inherited GC&nbsp; flag&nbsp; (1 or 0) -- 1 if node inherits genetic code from parent</p><p>&nbsp; mitochondrial genetic code id -- see gencode.dmp file</p><p>&nbsp; inherited MGC flag&nbsp; (1 or 0) -- 1 if node inherits mitochondrial gencode from parent</p><p>&nbsp; GenBank hidden flag (1 or 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- 1 if name is suppressed in GenBank entry lineage</p><p>&nbsp; hidden subtree root flag (1 or 0) &nbsp; &nbsp; &nbsp; -- 1 if this subtree has no sequence data yet</p><p>&nbsp; comments -- free-text comments and citations</p><p>&nbsp;</p><p>Taxonomy names file (names.dmp):</p><p>tax_id -- the id of node associated with this name</p><p>name_txt -- name itself</p><p>unique name -- the unique variant of this name if name not unique</p><p>name class -- (synonym, common name, ...)</p><p>&nbsp;</p><p>Divisions file (division.dmp):</p><p>division id -- taxonomy database division id</p><p>division cde -- GenBank division code (three characters)</p><p>division name -- e.g. BCT, PLN, VRT, MAM, PRI...</p><p>comments</p><p>&nbsp;</p><p>Genetic codes file (gencode.dmp):</p><p>genetic code id -- GenBank genetic code id</p><p>abbreviation -- genetic code name abbreviation</p><p>name -- genetic code name</p><p>cde -- translation table for this genetic code</p><p>starts -- start codons for this genetic code</p><p>&nbsp;</p><p>Deleted nodes file (delnodes.dmp):</p><p>tax_id -- deleted node id</p><p>&nbsp;</p><p>Merged nodes file (merged.dmp):</p><p>old_tax_id&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- id of nodes which has been merged</p><p>new_tax_id&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- id of nodes which is result of merging</p><p>Citations file (citations.dmp):</p><p>cit_id -- the unique id of citation</p><p>cit_key -- citation key</p><p>pubmed_id -- unique id in PubMed database (0 if not in PubMed)</p><p>medline_id -- unique id in MedLine database (0 if not in MedLine)</p><p>url -- URL associated with citation</p><p>text -- any text (usually article name and authors).</p><p>-- The following characters are escaped in this text by a backslash:</p><p>-- newline (appear as "\n"),</p><p>-- tab character ("\t"),</p><p>-- double quotes ('\"'),</p><p>-- backslash character ("\\").</p><p>taxid_list -- list of node ids separated by a single space</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</guid>
	<pubDate>Thu, 13 Aug 2020 10:24:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</link>
	<title><![CDATA[ClueGO: a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes]]></title>
	<description><![CDATA[<p>ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize. The identifiers can be uploaded from a text file or interactively from a network of Cytoscape. The type of identifiers supported can be easely extended by the user. ClueGO performs single cluster analysis and comparison of clusters. From the ontology sources used, the terms are selected by different filter criteria. The related terms which share similar associated genes can be fused to reduce redundancy. The ClueGO network is created with kappa statistics and reflects the relationships between the terms based on the similarity of their associated genes. On the network, the node colour can be switched between functional groups and clusters distribution. ClueGO charts are underlying the specificity and the common aspects of the biological role. The significance of the terms and groups is automatically calculated. ClueGO is easy updatable with the newest files from Gene Ontology and KEGG.</p><p>Address of the bookmark: <a href="http://www.ici.upmc.fr/cluego/" rel="nofollow">http://www.ici.upmc.fr/cluego/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44468/orthoflow-workflow-for-phylogenetic-inference-of-genome-scale-datasets-of-protein-coding-genes</guid>
	<pubDate>Wed, 21 Feb 2024 06:13:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44468/orthoflow-workflow-for-phylogenetic-inference-of-genome-scale-datasets-of-protein-coding-genes</link>
	<title><![CDATA[Orthoflow: workflow for phylogenetic inference of genome-scale datasets of protein-coding genes]]></title>
	<description><![CDATA[<p><span>Orthoflow is a workflow for phylogenetic inference of genome-scale datasets of protein-coding genes. Our goal was to make it straightforward to work from a combination of input sources including annotated contigs in Genbank format and FASTA files containing CDSs. It uses several state of the art inference methods for orthology inference, either based on HMM profiles or de novo inference of orthogroups. Through the use of OrthoSNAP, many additional ortholog alignments can be generated from multi-copy gene families. For phylogenetic inference, users can choose a supermatrix approach and/or gene tree inference followed by supertree reconstruction. Users can specify a range of alignment filtering settings to retain high-quality alignments for phylogenetic inference. The workflow produces a detailed report that, in addition to the phylogenetic results, includes a range of diagnostics to verify the quality of the results.</span></p><p>Address of the bookmark: <a href="https://github.com/rbturnbull/orthoflow" rel="nofollow">https://github.com/rbturnbull/orthoflow</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12111/internship-program-with-arraygen-technolgies</guid>
  <pubDate>Sun, 22 Jun 2014 23:18:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship program with ArrayGen Technolgies]]></title>
  <description><![CDATA[
<p>Internship Program for Bioinformatics / Biotechnology Professionals Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>

<p>Interested candidates may email their resume along with a cover letter to careers@arraygen.com</p>

<p>Official website: http://www.arraygen.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</guid>
	<pubDate>Mon, 09 Sep 2013 21:48:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</link>
	<title><![CDATA[Fourth Branch of Life]]></title>
	<description><![CDATA[<p>Scientist have found the biggest viruses known, pandoraviruses which opened up entirely /completely... new questions questions and raise objections to in science. It even suggesting a fourth domain of life.</p><p>The new visrus are about one micron&mdash;a thousandth of a millimeter&mdash;in length, the newfound genus Pandoravirus dwarfs other viruses, which range in size from about 50 nanometers up to 100 nanometers. A genus is a taxonomic ranking between species and family.</p><p>Find&nbsp; more at @ http://www.nature.com/scitable/blog/viruses101/newly_found_pandoraviruses_hint_at</p><p>http://news.nationalgeographic.co.uk/news/2013/07/130718-viruses-pandoraviruses-science-biology-evolution/</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</guid>
	<pubDate>Wed, 17 Jul 2013 16:16:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</link>
	<title><![CDATA[Master Thesis: Trans-membrane topology prediction through Markov based decoders]]></title>
	<description><![CDATA[<p dir="ltr"><span>Abstract:</span></p><p dir="ltr"><span></span><span>Background/Motivation: </span></p><p dir="ltr"><span>The dearth of structural information on alpha helical membrane protein (MPs) has hindered thus far the development of reliable knowledge &ndash;based potentials that can be used for automatic prediction of trans-membrane (TM) protein structure. While algorithm for identification of TM segments is available, modelling of the domains of alpha helical MPs involves assembling the segments into a bundle. This requires the correct assignment of the buried and lipid-exposed faces of the TM domains.</span><span>&nbsp;</span></p><p dir="ltr"><span>Results: </span><span><span><span>In a cross validated test on single sequences, our trans-membrane MM, correctly predicts the entire topology for 77% of the sequences in a standard dataset of 86 proteins with supervised topology. These results compare favorably with existing methods.</span></span></span><span>&nbsp;</span></p><p dir="ltr"><span><strong>Source Code</strong>: Matlab</span></p><p dir="ltr"><span></span><span>Conclusion/Implementation</span><span><span><span>: Here discriminant data mining approach was used to predict the location and orientation of alpha helices in membrane-spanning proteins. It is based on a first order Markov model (MM) with an architecture that corresponds closely to the biological systems. The model is enriched with three types of states for the loop on the cytoplasmic side (outer loop), loop for the non-cytoplasmic side (inner side), and trans-membrane part. The closed association between the biological and Markov states allows us to infer which part of the model architecture are important to capture the information which encodes the membrane topology, and gain a better understanding of the mechanism and constraints involved. Predictor Model was established by various &nbsp;Markov decoder , and assignment of the membrane helix boundaries was apparent.</span></span></span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/991" length="161792" type="application/vnd.ms-powerpoint" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/39939/automatic-predictive-model-constructor-apmc</guid>
	<pubDate>Mon, 16 Sep 2019 09:43:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39939/automatic-predictive-model-constructor-apmc</link>
	<title><![CDATA[Automatic Predictive Model Constructor - APMC]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><div><div><div><div><div>I would like to invite everyone interested in the subject of machine learning in life science, to test <strong>APMC</strong> module,</div><div>it`s a fully automatic tool (created by students) to simply create and develop supervised machine learning models</div><div>for classification and regression purposes. Links to tool, instruction and documentation bellow:</div><div><span style="font-size: 12.8px;"></span></div><ul>
<li><span style="font-size: 12.8px;">APMC:&nbsp;</span><a href="https://gene-calc.pl/apmc?fbclid=IwAR1j51l7qXsL3BuMPb-P5yQhwkmDCiVdoP-qodeCrbu2DbWtxtihRJ0n9-g" target="_blank">https://gene-calc.pl/apmc</a></li>
<li><span>How to use:&nbsp;</span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fgene-calc.pl%2Fapmc%2Fhow-to-use%3Ffbclid%3DIwAR3tCwJiegeuVn_ZZ-YPD7lB7UrqGWaab_zItU30MvFKZiuheSEiGUxyZ9Y&amp;h=AT1x8z09NwNUiLjTgNw8Vzg9OLsEjnpHESvjOescfLF-mzjMMqTBnkh5AqHRkOaXwjVHetdQtQO7mgstwke6ivUz-hzT-ifo5TrMBuMm8XMTmvhz7nyDdKmQZ38yyXW942J_47Oj5YxYxWaMDreugIU2ytT2yvxvgKi-FgNo4N7mvYoj_1A5eCuNxHWuGA3voYn0GAWSSR96ZK4gsj3pvqBcCK9Zi2Fo8IoBNK9JZIbtnV9fdvZLMEUryCoWEceZkMX-76jmGinOXss5L3AGp_6oSUr_aFus73B4q5PXMbKubUoU4inr-0kVoO0werx5YNPWdgXtpiyD6TKXQIhI6lDtyi2jx645A5CKqW-nARPqKwa-Iwtt-KGoNyHvcSnhvfLPK9n4Lhs8W6PK9ZeobOqHwm4y1C1my-N4dvlmvGBWTgSj_E31e0GIhYxvI9Uk3nREVnMw3lfD20BTmwL-wfhSidm8Lue_Akn1Flpfcl0jP1DBpkcwJ3OMxDVA82bL4lcsGmyLGedXjrpKAiVGF3R_e57r9EeI5bWyrbYZGTaHJdOGJBQSvplDir_AfH9Pr5NSRVZOStr13e6XxUIXhCiR58Qua_yuQOsNYBKGN5OP7XAL0DeFIKmI" target="_blank">https://gene-calc.pl/apmc/how-to-use</a></li>
<li><span>Documentation:&nbsp;</span><a href="https://gene-calc.pl/apmc/documentation?fbclid=IwAR1_2agQ8vnqDw0DudUI5UJq3_ip0EFwWR3zyccOynaDlbzkfFmYXnPtFXI" target="_blank">https://gene-calc.pl/apmc/documentation</a></li>
</ul></div></div></div></div></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>Jan Bińkowski</dc:creator>
</item>

</channel>
</rss>