The quartet distance is a metric used in phylogenetics to measure the structural similarity between two phylogenetic trees (or trees representing evolutionary relationships). It quantifies how dissimilar two trees are based on the arrangements of their leaf nodes, particularly looking at groups of four taxa (species or organisms). ### Key Points about Quartet Distance: 1. **Quartets**: Given any four taxa, there are three possible ways to arrange them in a bifurcating (or unrooted) tree.
TopHat is a bioinformatics software tool used primarily for aligning RNA-Seq reads to a reference genome. It is designed to handle the unique challenges posed by RNA sequencing data, particularly the splicing of eukaryotic genes. Key features of TopHat include: 1. **Detection of Splicing Events**: TopHat identifies exon-exon junctions in RNA-Seq data, which is essential for mapping reads that span across splice junctions where introns are excised.
The ViennaRNA Package is a widely used software suite for the prediction and analysis of RNA secondary structures. It is particularly useful in computational biology and bioinformatics for researchers studying RNA sequences, as it provides tools to predict how RNA folds and to analyze various structural features. Key features of the ViennaRNA Package include: 1. **RNA Secondary Structure Prediction**: It includes algorithms that predict the most stable secondary structure of an RNA sequence based on thermodynamic models.
The Boltzmann sampler is a probabilistic method used to generate samples from a distribution that is governed by the Boltzmann distribution (or Gibbs distribution). In statistical mechanics, the Boltzmann distribution describes the probability of a system being in a certain state based on its energy and the temperature of the system.
The term "reverse-search algorithm" can refer to different concepts in different contexts, but it often relates to search methods or strategies that are applied in various fields such as computer science, data structures, and graph theory. Below are some interpretations of what a reverse-search algorithm might involve: 1. **Graph Search Algorithms**: In graph theory, reverse-search may refer to algorithms that explore a graph from a target node back to the start node.
The Tompkins-Paige algorithm is an algorithm used in the field of computer science, particularly in the domain of automated theorem proving and logic programming. It is primarily used for the resolution of logical formulas. The algorithm focuses on the resolution principle, which is a fundamental method in propositional and first-order logic. It allows for the derivation of conclusions from premises using a process called resolution, which involves combining clauses to produce new clauses.
Geohash-36 is a variant of the Geohash encoding system, which is a method for encoding geographic coordinates (latitude and longitude) into a single string of characters. The traditional Geohash system uses a base-32 encoding scheme, utilizing 32 characters (which typically include letters and numbers) to represent the geographic area.
The VIX, or Volatility Index, is a popular measure of market expectations of near-term volatility as implied by S&P 500 index option prices. Often referred to as the "fear gauge," the VIX reflects investors' sentiment regarding future volatility in the stock market.
Ethos is a rhetorical appeal that refers to the credibility, character, or ethical appeal of the speaker or writer. It is one of the three modes of persuasion identified by Aristotle, alongside pathos (appeal to emotion) and logos (appeal to logic and reason). Ethos is used to establish trust and authority, persuading an audience by demonstrating that the speaker or writer is knowledgeable, trustworthy, and has the moral integrity to speak on the subject at hand.
The Maximum Common Induced Subgraph (MCIS) problem is a well-known computational problem in the field of graph theory and computer science. Given two graphs, the goal of the MCIS problem is to find the largest subgraph that is isomorphic to subgraphs of both input graphs. In other words, the task is to identify the largest set of vertices that can form an induced subgraph in both graphs while maintaining the same connectivity.
The Phi coefficient (φ) is a measure of association for two binary variables. It is used in statistics to evaluate the degree of association or correlation between the two variables and is particularly useful in the context of a 2x2 contingency table.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact