<?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/35131?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/35131?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Mon, 18 Jan 2021 10:47:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</guid>
	<pubDate>Fri, 07 Apr 2023 13:11:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</link>
	<title><![CDATA[Carrot2 clustering engine]]></title>
	<description><![CDATA[<h2>&nbsp;</h2>
<p>This is the demo application of the&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;clustering engine</a>. It uses Carrot<sup>2</sup>'s algorithms to organize search results into thematic folders.</p>
<h3>User interfaces</h3>
<ul>
<li><span><a href="https://search.carrot2.org/#/search/:source">Web Search Clustering</a></span>&nbsp;organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.</li>
<li><span><a href="https://search.carrot2.org/#/workbench">Clustering Workbench</a></span>&nbsp;clusters content from local files in JSON or Excel format, Solr or Elasticsearch; allows tuning of clustering parameters and exporting results as Excel or JSON.</li>
</ul>
<h3>Search engines</h3>
<ul>
<li><span>Web</span>:&nbsp;<span>web search results provided by&nbsp;<a href="https://etools.ch/" target="_blank">etools.ch</a>. Extensive use may require special arrangements with the&nbsp;<a href="mailto:sschmid@comcepta.com" target="_blank">owner</a>&nbsp;of the etools.ch service.</span></li>
<li><span>PubMed</span>:&nbsp;<span>abstracts of medical papers from the PubMed database provided by NCBI.</span></li>
<li><span>Local file</span>:&nbsp;<span>content read from a local file in Carrot2 XML, JSON, CSV or Excel format.</span></li>
<li><span>Solr</span>:&nbsp;<span>queries an Apache Solr instance.</span></li>
<li><span>Elasticsearch</span>:&nbsp;<span>queries an Elasticsearch instance.</span></li>
</ul>
<h3>Clustering algorithms</h3>
<ul>
<li><span>Lingo</span>:&nbsp;<span>creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a>.</span></li>
<li><span>STC</span>:&nbsp;<span>the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
<li><span>k-means</span>:&nbsp;<span>base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
</ul><p>Address of the bookmark: <a href="https://search.carrot2.org/#/search/web" rel="nofollow">https://search.carrot2.org/#/search/web</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</guid>
	<pubDate>Sun, 27 Jul 2014 20:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</link>
	<title><![CDATA[You and your friend have similar DNA !!!]]></title>
	<description><![CDATA[<p>New research out of Massachusetts claims that people often choose friends that are similar to them in genetics and they are more accurate than you might suppose. A study published on PNAS&nbsp;http://www.pnas.org/content/111/Supplement_3/10796.full found that people are apt to pick friends who are genetically similar to themselves - so much so that friends tend to be as alike at the genetic level as a person's fourth cousin.</p><div style="text-align: center;"><img src="http://i.kinja-img.com/gawker-media/image/upload/s--CwLwHa43--/18fbmlokxcmqcjpg.jpg" alt="image" width="300" height="271" style="border: 0px; border: 0px;"></div><p>Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes &mdash; a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population.&nbsp;</p><p>The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.</p><p>Reference:</p><p>http://www.pnas.org/content/111/Supplement_3/10796.full</p><p>Image : http://i.kinja-img.com</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</guid>
	<pubDate>Tue, 05 Jul 2016 10:02:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</link>
	<title><![CDATA[Bioinformatics tools and software]]></title>
	<description><![CDATA[<p><a href="http://drive5.com/usearch">USEARCH &gt;</a><br><span>Extreme high-throughput sequence analysis. Orders of magnitude faster than BLAST.</span>&nbsp;<a href="http://drive5.com/muscle">MUSCLE &gt;</a><br><span>Multiple sequence alignment. Faster and more accurate than CLUSTALW.</span></p>
<p>&nbsp;<a href="http://drive5.com/uparse">UPARSE &gt;</a><br><span>OTU clustering for 16S and other marker genes. Highly accurate OTU sequences and improved diversity measures.</span>&nbsp;<a href="http://drive5.com/uchime">UCHIME &gt;</a><br><span>Chimeric sequence detection.</span>&nbsp;<a href="http://drive5.com/piler">PILER &gt;</a><br><span>De novo genome repeat finder.</span>&nbsp;<a href="http://drive5.com/pilercr">PILER-CR &gt;</a><br><span>Detection of CRISPR repeats in bacterial genomes.</span>&nbsp;<a href="http://drive5.com/qscore">QSCORE &gt;</a><br><span>Compare two multiple alignments for benchmarking.</span>&nbsp;<a href="http://drive5.com/pals">PALS &gt;</a><br><span>Whole-genome alignment.</span>&nbsp;<a href="http://drive5.com/muscle/prefab.htm">PREFAB &gt;</a><br><span>Protein Reference Alignment Database.</span>&nbsp;<a href="http://drive5.com/bench">MSA benchmark collection &gt;</a><br><span>Selected multiple alignment benchmarks in a standardized FASTA format.</span></p><p>Address of the bookmark: <a href="http://drive5.com/software.html" rel="nofollow">http://drive5.com/software.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28554/megan6</guid>
	<pubDate>Mon, 25 Jul 2016 05:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28554/megan6</link>
	<title><![CDATA[MEGAN6]]></title>
	<description><![CDATA[<p>Microbiome analysis using a single application</p>
<p>MEGAN6 is a comprehensive toolbox for interactively analyzing microbiome data. All the interactive tools you need in one application.</p>
<ul>
<li>Taxonomic analysis using the NCBI taxonomy or a customized taxonomy such as SILVA</li>
<li>Functional analysis using InterPro2GO, SEED, eggNOG or KEGG</li>
<li>Bar charts, word clouds, Voronoi tree maps and many other charts</li>
<li>PCoA, clustering and networks</li>
<li>Supports metadata</li>
<li>MEGAN parses many different types of input</li>
</ul>
<p>Why use MEGAN6?</p>
<div>&nbsp;The software is:</div>
<div><ol>
<li>Easy to use. MEGAN6 is a single application and all features are available through menus, toolbars and graphics. No scripting skills required.</li>
<li>Powerful. MEGAN6 allows you to work with hundreds of samples containing&nbsp;hundreds of millions of sequencing reads. Blast-like analysis can be performed using DIAMOND.</li>
<li>Comprehensive. MEGAN6 offers a large range of analysis tools, and is under active development.</li>
</ol></div><p>Address of the bookmark: <a href="https://ab.inf.uni-tuebingen.de/software/megan6" rel="nofollow">https://ab.inf.uni-tuebingen.de/software/megan6</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</guid>
	<pubDate>Tue, 08 Nov 2016 07:09:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</link>
	<title><![CDATA[Bioistats PPT]]></title>
	<description><![CDATA[<p>Basics concepts of&nbsp;Probability: The Study of Randomness</p><p>Biostatistics is the application of statistics to a wide range of topics in biology. The science of biostatistics encompasses the design of biological experiments, especially in medicine, pharmacy, agriculture and fishery; the collection, summarization, and analysis of data from those experiments; and the interpretation of, and inference from, the results. A major branch of this is medical biostatistics, which is exclusively concerned with medicine and health.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29652" length="1663809" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29992/spines</guid>
	<pubDate>Mon, 28 Nov 2016 05:33:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29992/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<p><a href="https://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a>&nbsp;is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages:&nbsp;<em>Satsuma,</em>&nbsp;a highly parallelized program for high-sensitivity, genome-wide synteny;&nbsp;<em>Papaya,</em>&nbsp;an all-purpose alignment tool for less diverged sequences; and&nbsp;<em>SLAP,</em>&nbsp;a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access&nbsp;<em>Spines</em>&nbsp;<a href="https://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/genome-sequencing-and-analysis/spines" rel="nofollow">https://www.broadinstitute.org/genome-sequencing-and-analysis/spines</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</guid>
	<pubDate>Fri, 16 Dec 2016 11:09:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</link>
	<title><![CDATA[Gene Synteny Database]]></title>
	<description><![CDATA[<p>Comparative genomics remains a pivotal strategy to study the evolution of gene organization, and this primacy is reinforced by the growing number of full genome sequences available in public repositories. Despite this growth, bioinformatic tools available to visualize and compare genomes and to infer evolutionary events remain restricted to two or three genomes at a time, thus limiting the breadth and the nature of the question that can be investigated. Here we present Genomicus, a new synteny browser that can represent and compare unlimited numbers of genomes in a broad phylogenetic view. In addition, Genomicus includes reconstructed ancestral gene organization, thus greatly facilitating the interpretation of the data.</p>
<p><strong>Availability:</strong>&nbsp;Genomicus is freely available for online use at&nbsp;<a href="http://www.dyogen.ens.fr/genomicus" target="pmc_ext">http://www.dyogen.ens.fr/genomicus</a>&nbsp;while data can be downloaded at&nbsp;<a href="ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus" target="pmc_ext">ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">rf.sne.eigoloib@crh</a></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>