HEPBS

Last updated
HEPBS
HEPBS.png
Names
Preferred IUPAC name
4-[4-(2-Hydroxyethyl)piperazin-1-yl]butane-1-sulfonic acid
Other names
HEPBS
Identifiers
3D model (JSmol)
PubChem CID
  • InChI=1S/C10H22N2O4S/c13-9-8-12-6-4-11(5-7-12)3-1-2-10-17(14,15)16/h13H,1-10H2,(H,14,15,16)
    Key: LOJNFONOHINEFI-UHFFFAOYSA-N
  • C1CN(CCN1CCCCS(=O)(=O)O)CCO
Properties
C10H22N2O4S
Molar mass 266.356 g/mol
AppearanceWhite crystalline powder
Density 1.25 g/cm3 (predicted)
Melting point 211–216 °C (412–421 °F; 484–489 K)
Acidity (pKa)8.3
Hazards
Occupational safety and health (OHS/OSH):
Main hazards
Irritant
GHS labelling:
Warning
H315, H319, H335
P261, P264, P271, P280, P302+P352, P304+P340, P305+P351+P338, P312, P321, P332+P313, P337+P313, P362, P403+P233, P405, P501
Flash point Non-flammable
Except where otherwise noted, data are given for materials in their standard state (at 25 °C [77 °F], 100 kPa).

HEPBS (N-(2-Hydroxyethyl)piperazine-N'-(4-butanesulfonic acid)) is a zwitterionic organic chemical buffering agent; one of Good's buffers. HEPBS and HEPES have very similar structures and properties, HEPBS also having an acidity (pKa) in the physiological range (7.6-9.0 useful range). This makes it possible to use it for cell culture work.

HEPBS H NMR spectrum. HEPBS 1H NMR spectrum.png
HEPBS H NMR spectrum.

Related Research Articles

A conjugate acid, within the Brønsted–Lowry acid–base theory, is a chemical compound formed when an acid gives a proton to a base—in other words, it is a base with a hydrogen ion added to it, as it loses a hydrogen ion in the reverse reaction. On the other hand, a conjugate base is what remains after an acid has donated a proton during a chemical reaction. Hence, a conjugate base is a substance formed by the removal of a proton from an acid, as it can gain a hydrogen ion in the reverse reaction. Because some acids can give multiple protons, the conjugate base of an acid may itself be acidic.

A buffer solution is an acid or a base aqueous solution consisting of a mixture of a weak acid and its conjugate base, or vice versa. Its pH changes very little when a small amount of strong acid or base is added to it. Buffer solutions are used as a means of keeping pH at a nearly constant value in a wide variety of chemical applications. In nature, there are many living systems that use buffering for pH regulation. For example, the bicarbonate buffering system is used to regulate the pH of blood, and bicarbonate also acts as a buffer in the ocean.

<span class="mw-page-title-main">Z-buffering</span> Type of data buffer in computer graphics

A depth buffer, also known as a z-buffer, is a type of data buffer used in computer graphics to represent depth information of objects in 3D space from a particular perspective. Depth buffers are an aid to rendering a scene to ensure that the correct polygons properly occlude other polygons. Z-buffering was first described in 1974 by Wolfgang Straßer in his PhD thesis on fast algorithms for rendering occluded objects. A similar solution to determining overlapping polygons is the painter's algorithm, which is capable of handling non-opaque scene elements, though at the cost of efficiency and incorrect results.

<span class="mw-page-title-main">Framebuffer</span> Portion of random-access memory containing a bitmap that drives a video display

A framebuffer is a portion of random-access memory (RAM) containing a bitmap that drives a video display. It is a memory buffer containing data representing all the pixels in a complete video frame. Modern video cards contain framebuffer circuitry in their cores. This circuitry converts an in-memory bitmap into a video signal that can be displayed on a computer monitor.

The C programming language provides many standard library functions for file input and output. These functions make up the bulk of the C standard library header <stdio.h>. The functionality descends from a "portable I/O package" written by Mike Lesk at Bell Labs in the early 1970s, and officially became part of the Unix operating system in Version 7.

<span class="mw-page-title-main">Buffer zone</span> Intermediate region, typically between belligerent entities

A buffer zone is a neutral zonal area that lies between two or more bodies of land, usually pertaining to countries. Depending on the type of buffer zone, it may serve to separate regions or conjoin them. Common types of buffer zones are demilitarized zones, border zones and certain restrictive easement zones and green belts. Such zones may be comprised by a sovereign state, forming a buffer state.

<span class="mw-page-title-main">Railway coupling</span> Mechanism for connecting rolling stock in a train

A coupling is a mechanism typically placed at each end of a railway vehicle that connects them together to form a train. A variety of coupler types have been developed over the course of railway history. Key issues in their design include strength, reliability, ease of making connections and operator safety.

<span class="mw-page-title-main">Silent Valley National Park</span> National park in Kerala, India

Silent Valley National Park is a national park in Kerala, India. It is located in the Nilgiri hills and has a core area of 89.52 km2 (34.56 sq mi). It is surrounded by a buffer zone of 148 km2 (57 sq mi). This national park has some rare species of flora and fauna. Silent Valley National Park was explored in 1847 by the botanist Robert Wight. It is located in the border of Mannarkkad Taluk of Palakkad district, Nilambur Taluk of Malappuram district, Kerala, and Nilgiris district of Tamil Nadu.

In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity. It was created in 2003 by A. O. L. Atkin and Daniel J. Bernstein.

<span class="mw-page-title-main">Integer overflow</span> Computer arithmetic error

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of digits – either higher than the maximum or lower than the minimum representable value.

<span class="mw-page-title-main">Quicksort</span> Divide and conquer sorting algorithm

Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly on larger distributions.

<span class="mw-page-title-main">PIPES</span> Chemical compound

PIPES is the common name for piperazine-N,N-bis(2-ethanesulfonic acid), and is a frequently used buffering agent in biochemistry. It is an ethanesulfonic acid buffer developed by Good et al. in the 1960s.

Reversed-phase Liquid chromatography (RP-LC) is a mode of liquid chromatography in which non-polar stationary phase and polar mobile phases are used for the separation of organic comounds. The vast majority of separations and analyses using High Performance Liquid Chromatography-HPLC in recent years are done using the Reversed Phase mode. In the Reversed Phase mode, the sample components are retained in the system, the more hydrophobic they are. 

Acid–base homeostasis is the homeostatic regulation of the pH of the body's extracellular fluid (ECF). The proper balance between the acids and bases in the ECF is crucial for the normal physiology of the body—and for cellular metabolism. The pH of the intracellular fluid and the extracellular fluid need to be maintained at a constant level.

In computing, the producer-consumer problem is a family of problems described by Edsger W. Dijkstra since 1965.

<span class="mw-page-title-main">CHES (buffer)</span> Chemical compound

CHES is a buffering agent. CHES buffers have a useful range of pH 8.6–10.

<span class="mw-page-title-main">Circular buffer</span> A circular shaped buffer shown while obtaining data

In computer science, a circular buffer, circular queue, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data streams. There were early circular buffer implementations in hardware.

In computer science, a fractal tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree but with insertions and deletions that are asymptotically faster than a B-tree. Like a B-tree, a fractal tree index is a generalization of a binary search tree in that a node can have more than two children. Furthermore, unlike a B-tree, a fractal tree index has buffers at each node, which allow insertions, deletions and other changes to be stored in intermediate locations. The goal of the buffers is to schedule disk writes so that each write performs a large amount of useful work, thereby avoiding the worst-case performance of B-trees, in which each disk write may change a small amount of data on disk. Like a B-tree, fractal tree indexes are optimized for systems that read and write large blocks of data. The fractal tree index has been commercialized in databases by Tokutek. Originally, it was implemented as a cache-oblivious lookahead array, but the current implementation is an extension of the Bε tree. The Bε is related to the Buffered Repository Tree. The Buffered Repository Tree has degree 2, whereas the Bε tree has degree Bε. The fractal tree index has also been used in a prototype filesystem. An open source implementation of the fractal tree index is available, which demonstrates the implementation details outlined below.

<span class="mw-page-title-main">Block sort</span> Efficient sorting algorithm that combines insert and merge operations

Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big O notation) in-place stable sorting time. It gets its name from the observation that merging two sorted lists, A and B, is equivalent to breaking A into evenly sized blocks, inserting each A block into B under special rules, and merging AB pairs.

<span class="mw-page-title-main">Nahá–Metzabok</span>

Nahá–Metzabok Biosphere Reserve is a biosphere reserve in southeastern Mexico. It is located in the state of Chiapas, on the northeastern flank of the Chiapas Highlands. The reserve protects montane rain forests, pine and oak forests, and natural lakes.

References