<?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/41442?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/41442?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</guid>
	<pubDate>Sun, 02 Feb 2020 14:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</link>
	<title><![CDATA[DMINDA2: an integrated web server for DNA motif identification and analyses]]></title>
	<description><![CDATA[<p><span>DMINDA (</span><strong>D</strong><span>NA&nbsp;</span><strong>m</strong><span>otif&nbsp;</span><strong>i</strong><span>dentification a</span><strong>nd a</strong><span>nalyses) is an integrated web server for DNA motif identification and analyses</span></p>
<p><span>More at&nbsp;http://bmbl.sdstate.edu/DMINDA2/</span></p>
<p><span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/</a></span></p><p>Address of the bookmark: <a href="http://bmbl.sdstate.edu/DMINDA2/" rel="nofollow">http://bmbl.sdstate.edu/DMINDA2/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44885/firecrawl-the-web-data-api-for-ai-turn-entire-websites-into-llm-ready-markdown-or-structured-data</guid>
	<pubDate>Thu, 28 Aug 2025 02:34:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44885/firecrawl-the-web-data-api-for-ai-turn-entire-websites-into-llm-ready-markdown-or-structured-data</link>
	<title><![CDATA[Firecrawl: The Web Data API for AI - Turn entire websites into LLM-ready markdown or structured data]]></title>
	<description><![CDATA[<p dir="auto"><a href="https://firecrawl.dev/?ref=github">Firecrawl</a>&nbsp;is an API service that takes a URL, crawls it, and converts it into clean markdown or structured data. We crawl all accessible subpages and give you clean data for each. No sitemap required. Check out our&nbsp;<a href="https://docs.firecrawl.dev/">documentation</a>.</p>
<p dir="auto"><em>Pst. hey, you, join our stargazers :)</em></p>
<p><em>&nbsp;</em></p>
<p><a href="https://github.com/firecrawl/firecrawl"></a></p><p>Address of the bookmark: <a href="https://github.com/firecrawl/firecrawl" rel="nofollow">https://github.com/firecrawl/firecrawl</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34814/bioinformatics-web-application-development-with-perl</guid>
	<pubDate>Tue, 26 Dec 2017 18:14:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34814/bioinformatics-web-application-development-with-perl</link>
	<title><![CDATA[Bioinformatics Web Application Development with Perl]]></title>
	<description><![CDATA[<div><p>Perl's second wave of adoption came from the growth of the world wide web. Dynamic web pages&mdash;the precursor to modern web applications&mdash;were easy to create with Perl and CGI. Thanks to Perl's ubiquity as a language for system administrators and its power to manipulate text, it was the default choice for web programming. Its presence everywhere made it popular and, in some ways, the duct tape of the Internet.</p><h4>Web Application Development</h4><p>The old days of CGI programs and the simple development style that represented seem clunky. Web pages have become web applications. Development has moved from generating static HTML to both client and server side programming, with rich client interfaces and powerful backends.</p><p>Perl is still well suited for developing modern web apps. The language grows more powerful and easier to use every year, the available libraries are wonderful and keep getting better, and the inventions and discoveries available in modern Perl are unsurpassed.</p><p>In particular, a modern Perl developer can do amazing things with modern Perl tools. If you still think of Perl web development as a&nbsp;<em>cgi-bin</em>&nbsp;directory full of messy scripts that spew warnings to STDERR, you're a decade out of date. Better yet, you can replace that mess piecemeal, thanks to the new tools and techniques of modern Perl. See, for example, the ever-growing list of technologies&nbsp;<a href="http://www.builtinperl.com/">Built in Perl</a>.</p><h4>Modern Perl Web Frameworks</h4><p>While the old wave of web development may have made the CGI.pm module central, modern Perl web programming follows a stricter separation of business logic, URL and request routing, and output. The days of slinging a string here, an array there, a Perl hash yonder, declaring every variable at the top of the program, and maybe making a subroutine are gone. The Perl world has seen the value of abstraction and ways to mechanize away boilerplate. Perl has dozens of frameworks and toolkits designed to make web development and deployment simpler.</p><p>Any of a dozen of these frameworks will help you do great things, but three in particular stand out. You can build web sites and web applications of tremendous value with all three. These are neither the only good possibilities (think of POE or Jifty or Continuity or...) nor the only mechanisms for web programming with Perl (see Mechanize or LWP or Mojo::UserAgent for more). Yet if you want three good options to choose between, start here.</p><h4>Catalyst</h4><p>The&nbsp;<a href="http://catalystframework.org/">Catalyst</a>&nbsp;framework is a flexible and powerful system for building small to large web apps. It uses the&nbsp;<a href="http://moose.perl.org/">Moose</a>&nbsp;object system to provide great APIs for extension and further development. It's the most mature of the modern top Perl web frameworks, yet it retains its flexibility and vibrancy. In particular, its plugin and extension ecosystem allows it to evolve to provide new and essential features.</p><p>Catalyst has embraced the Plack/PSGI standard for Perl web deployment and recent versions are exploring high-scalability, event-based request handling models.</p><h4>Dancer</h4><p>The&nbsp;<a href="http://perldancer.org/">Dancer</a>&nbsp;framework is deliberately minimal in syntax and scope, but it also has a vibrant plugin ecosystem. Dancer particularly excels for smaller sites and applications, though good programmers can build larger things with it.</p><p>The first version of Dancer was easy to use. Dancer 2 continues that ease while improving the internals and robustness of applications.</p><h4>Mojolicious</h4><p>The&nbsp;<a href="http://mojolicio.us/">Mojolicious</a>&nbsp;(Mojo) framework has a real-time design based on high performance event handling. Its focus is solving new and interesting problems in simple and effective ways, and the project has produced a lot of new code that does old things in better ways.</p><p>In particular, Mojolicious goes to great lengths to support new web standards, such as CSS 3, web sockets, and HTTP 2.</p><p>Where Catalyst embraces the CPAN fully, Mojolicious by design provides most of what an average app might need in a single download. It's still fully compatible with the CPAN, but the intention is to provide good working defaults in a package that's easy to start with. Mojo's fans are quick to praise it as fun to develop.</p><p>A modern Perl web developer should be familiar with at least one of these frameworks.</p><h4>Modern Perl Storage Mechanisms</h4><p>Perl's venerable&nbsp;<a href="http://search.cpan.org/perldoc?DBI">DBI</a>&nbsp;module has been the focal point of database access since its invention. Its design allows it to provide the same interface to huge relational databases and flat files alike through its DBD extension mechanism. Yet the DBI by itself isn't the be-all, end-all of data storage and access in Perl.</p><h4>DBIx::Class</h4><p><a href="http://search.cpan.org/perldoc?DBIx::Class">DBIx::Class</a>&nbsp;sits on top of DBI to provide an API to your database based on the concept of queries and results. This is often sufficient to remove all but the most complicated of SQL from your code, leaving you to manipulate your business models instead of the small details of how a relational database works. The power and maintainability you receive is well the small cost of the learning curve.</p><p>Even better, DBIC can manage (and even generate) your database schema for you.</p><p>Recent versions of DBIC have demonstrated that a well-written ORM can perform much better than even clever hand-written code. Because it builds on the Perl DBI, it scales everywhere from SQLite to PostgreSQL, MySQL, Oracle, and more.</p><h3>Rose::DB</h3><p>The lesser-known but no less powerful&nbsp;<a href="http://search.cpan.org/perldoc?Rose::DB::Object">Rose::DB::Object</a>&nbsp;builds on&nbsp;<a href="http://search.cpan.org/perldoc?Rose::DB">Rose::DB</a>&nbsp;to provide an object-relational mapper for Perl. While its high level features most directly compare to those of DBIx::Class, it's often measurably faster.</p><h4>NoSQL on the CPAN</h4><p>Of course the&nbsp;<a href="http://search.cpan.org/">CPAN</a>&nbsp;has modules for almost any NoSQL database or job queue or persistence mechanism you could name, and several you have never heard of. Everything you need is a quick CPAN or cpanm away!</p><h4>Modern Perl Deployment Strategies</h4><p>In the early days of the web, deploying a Perl web application meant putting one or more&nbsp;<em>.cgi</em>&nbsp;or&nbsp;<em>.pl</em>&nbsp;files in a special directory and hoping that your system administrator had everything configured correctly. The execution model was often slow and cumbersome, and accessing shared resources such as databases was often tricky.</p><p>Modern Perl has better choices. While deployment strategies are the source of many arguments, the return on your investment from learning the modern way is impressive.</p><h4>Plack/PSGI</h4><p>The PSGI specification (as exemplified by&nbsp;<a href="http://plackperl.org/">Plack</a>) describes a strategy for building Perl web apps independent of server and with the possibility to share custom processing behaviors.</p><p>In other words, it's a standard for writing Perl apps to take advantage of the huge ecosystem of Perl development available on the CPAN without tying yourself to a server like Apache, Apache 2, nginx, or anything else.</p><p>Any good modern Perl web framework (including those listed here) supports PSGI. Several deployment mechanisms exist to meet various business needs which also support PSGI. In particular, you can deploy the same application with a local testing server on your own machine as you can to your production server or servers without changing your application at all.</p><h4>mod_perl</h4><p>The older but still viable mod_perl Apache httpd module embeds Perl into the web server. This was the first widespread persistence mechanism for Perl web applications themselves and it's still popular to this day, though PSGI compliance is often the choice for new development. (PSGI handlers to use mod_perl as the backend are available.)</p><p>Modern Perl developers should familiarize themselves with PSGI and the wealth of available Plack middleware.</p><h4>Perl Web Development</h4><p>Of course no discussion of Perl web development would be complete without mentioning the strength of the CPAN. Almost any project will benefit from the wealth of freely available libraries built to solve real problems. These distributions run the gamut from full-blown web frameworks and content management systems to APIs for web services, development tools, testing systems, and interfaces to document formats and external resources.</p><p>For example, if you need to write a web service which accepts JSON data and produces Excel spreadsheets, you can glue together a few CPAN distributions and get the job done early. If you need to consume XML from a remote service and emit a PDF, you're in luck.</p><p>Perl's prowess as a general purpose programming language as well as its flexibility and power in managing text and gluing systems together make it a wonderful fit for web development. The community's adoption of modern Perl standards such as PSGI and Plack only enhance your power.</p><p>Web application development in Perl is still viable, and modern Perl tools and techniques and libraries make it more powerful and pleasant than ever.</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44213/bioinformatics-tools-to-explore-ssrs-in-genomes</guid>
	<pubDate>Tue, 07 Mar 2023 13:06:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44213/bioinformatics-tools-to-explore-ssrs-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to explore SSRs in genomes !]]></title>
	<description><![CDATA[<p>There are several bioinformatics tools that can be used to explore Simple Sequence Repeats (SSRs), which are also known as microsatellites. Here are a few examples:</p><ol>
<li>
<p>MISA: MISA (MIcroSAtellite) is a web-based tool that can identify SSRs in DNA sequences. It can be used to analyze nucleotide sequences from various organisms and can identify perfect, compound, and imperfect SSRs.</p>
</li>
<li>
<p>SSR Locator: SSR Locator is a web-based tool that identifies SSRs in both DNA and RNA sequences. It can identify perfect, compound, and imperfect SSRs, and can also filter out low complexity regions.</p>
</li>
<li>
<p>SciRoKo: SciRoKo is a software tool that can identify SSRs in DNA sequences. It can be used to analyze genomic and transcriptomic sequences from various organisms and can identify perfect, compound, and imperfect SSRs.</p>
</li>
<li>
<p>Primer3: Primer3 is a web-based tool that designs PCR primers for SSRs. It can design primers for perfect and imperfect SSRs, and can be used to design primers for SSRs in various organisms.</p>
</li>
<li>
<p>QDD: QDD (Quick Detection of Duplication) is a software tool that can identify SSRs in DNA sequences and can also identify duplicate loci. It can be used to analyze genomic and transcriptomic sequences from various organisms.</p>
</li>
</ol><p>These are just a few examples of the many bioinformatics tools available for exploring SSRs. Depending on your specific needs and research questions, you may find that other tools are more appropriate for your analysis.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</guid>
	<pubDate>Thu, 15 Aug 2013 11:08:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</link>
	<title><![CDATA[Bioinformatics Codes Search]]></title>
	<description><![CDATA[<p>I bet, this website will be your best friend in near future. This helps us to explore the existing open source codes and learn from it.</p>
<p>You can find some useful open source bioinformatics codes for your analysis work. You can use the left bar options to filtere out or narrow down your search result. This webpage can be an useful resource for a beginners bioinformatician as it contain several bioinformatics basics script that are commonly used by biological programmers and biologist.</p>
<p>Stand on the slumped, dandruff-covered shoulders of millions of computer nerds. _/\_</p>
<p>Enjoy the code and research work.</p>
<p>http://code.ohloh.net/search?s=bioinformatics</p><p>Address of the bookmark: <a href="http://code.ohloh.net/search?s=bioinformatics" rel="nofollow">http://code.ohloh.net/search?s=bioinformatics</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</guid>
	<pubDate>Sat, 08 Jun 2024 16:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</link>
	<title><![CDATA[MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly]]></title>
	<description><![CDATA[<p><span>The MetaGraph framework</span><span>&nbsp;is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as&nbsp;</span><a href="https://metagraph.ethz.ch/#query">sequence search</a><span>&nbsp;or&nbsp;</span><a href="https://metagraph.ethz.ch/#assembly">differential assembly</a><span>.</span></p>
<p><span>Searcg link&nbsp;https://metagraph.ethz.ch/search&nbsp;</span></p>
<p><span>Pre-print&nbsp;https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4&nbsp;</span></p><p>Address of the bookmark: <a href="https://metagraph.ethz.ch/" rel="nofollow">https://metagraph.ethz.ch/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</guid>
	<pubDate>Thu, 22 Mar 2018 10:40:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2.0: ultra fast and sensitive protein search and clustering suite]]></title>
	<description><![CDATA[<p>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein 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.</p>
<p>The MMseqs2 user guide is available as&nbsp;<a href="https://github.com/soedinglab/mmseqs2/wiki">Github Wiki</a>&nbsp;or as&nbsp;<a href="https://mmseqs.com/latest/userguide.pdf">PDF file</a>&nbsp;(Thanks to&nbsp;<a href="https://github.com/jgm/pandoc">pandoc</a>!)</p>
<p>Please cite:&nbsp;<a href="https://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3988.html">Steinegger M and Soeding J. MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nature Biotechnology, doi: 10.1038/nbt.3988 (2017)</a>.</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>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/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>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</guid>
	<pubDate>Fri, 09 Jun 2017 04:43:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</link>
	<title><![CDATA[TARDIS: Toolkit for automated and rapid discovery of structural variants]]></title>
	<description><![CDATA[<p>tardis</p>
<p>Toolkit for Automated and Rapid DIscovery of Structural variants</p>
<p>Requirements</p>
<p>zlib (http://www.zlib.net)<br>mrfast (https://github.com/BilkentCompGen/mrfast)<br>htslib (included as submodule; http://htslib.org/)<br>Fetching tardis</p>
<p>git clone https://github.com/BilkentCompGen/tardis.git --recursive</p>
<p>&nbsp;</p>
<p>https://github.com/BilkentCompGen/tardis</p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/tardis" rel="nofollow">https://github.com/BilkentCompGen/tardis</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>