A maximal unique match or MUM, for short, is part of a key step in the multiple sequence alignment of genomes in computational biology. Identification...
7 KB (779 words) - 21:36, 31 March 2024
Sequence alignment (section Maximal unique match)
of quantifying the utility of a given pairwise alignment is the 'maximal unique match' (MUM), or the longest subsequence that occurs in both query sequences...
56 KB (6,913 words) - 09:31, 31 May 2025
episode M-U-M (Magic-Unity-Might) magazine Multifocal plane microscopy Maximal unique match Monash University, Malaysia campus Maharishi University of Management...
1 KB (184 words) - 01:55, 21 May 2025
the essential uniqueness of the inner product. A maximal compact subgroup is a maximal subgroup amongst compact subgroups – a maximal (compact subgroup)...
12 KB (1,772 words) - 09:48, 15 April 2025
here, there is no requirement that a maximal subgroup be proper, so if S is in fact a group then its unique maximal subgroup (as a semigroup) is S itself...
4 KB (385 words) - 22:49, 15 November 2023
top-ranks maximal lotteries has been uniquely characterized using Arrow's independence of irrelevant alternatives and Pareto efficiency. Maximal lotteries...
10 KB (1,282 words) - 04:41, 24 June 2025
determine how a genome has changed. The acronym "MUMmer" comes from "Maximal Unique Matches", or MUMs. The original algorithms in the MUMMER software package...
8 KB (819 words) - 12:53, 25 May 2025
prime knots is essentially unique. A maximal compact subgroup of a semisimple Lie group may not be unique, but is unique up to conjugation. An object...
6 KB (682 words) - 08:14, 21 September 2024
In mathematics, the Hardy–Littlewood maximal operator M is a significant non-linear operator used in real analysis and harmonic analysis. The operator...
11 KB (1,890 words) - 18:21, 11 June 2025
LZ77 and LZ78 (category Short description matches Wikidata)
found first and allow the search to terminate, absolutely if the current maximal matching sequence length is met, or judiciously, if a sufficient length...
18 KB (2,566 words) - 09:26, 9 January 2025
Composition series (category Short description matches Wikidata)
is a chief series: a composition series is a maximal subnormal series, while a chief series is a maximal normal series. If a group G has a normal subgroup...
9 KB (1,331 words) - 16:45, 28 December 2024
Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1. The...
21 KB (2,797 words) - 23:29, 23 June 2025
Longest element of a Coxeter group (category Short description matches Wikidata)
In mathematics, the longest element of a Coxeter group is the unique element of maximal length in a finite Coxeter group with respect to the chosen generating...
3 KB (382 words) - 00:53, 27 May 2025
Apollonian network (section Unique colorability)
may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked...
41 KB (4,752 words) - 07:28, 24 February 2025
Erdős–Ko–Rado theorem (redirect from Maximal intersecting family)
sets. An intersecting family of r {\displaystyle r} -element sets may be maximal, in that no further set can be added (even by extending the ground set)...
44 KB (5,592 words) - 20:57, 17 April 2025
Cartan subalgebra (category Short description matches Wikidata)
{\displaystyle \mathbb {C} } ), a Cartan subalgebra is the same thing as a maximal abelian subalgebra consisting of elements x such that the adjoint endomorphism...
15 KB (2,053 words) - 11:13, 22 February 2025
Planar graph (redirect from Maximal planar graph)
chordal graphs respectively. Every maximal planar graph on more than 3 vertices is at least 3-connected. If a maximal planar graph has v vertices with v...
35 KB (4,541 words) - 18:29, 29 May 2025
Differential structure (category Short description matches Wikidata)
of precision, one might just call a maximal Ck−atlas on a given set a Ck−manifold. This maximal atlas then uniquely determines both the topology and the...
10 KB (1,342 words) - 03:50, 26 July 2024
230 (number) (category Short description matches Wikidata)
the aliquot sum of both 454 and 52441. part of the 41-aliquot tree. the maximal number of pieces that can be obtained by cutting an annulus with 20 cuts...
2 KB (250 words) - 22:08, 2 January 2025
Compact group (category Short description matches Wikidata)
element of K {\displaystyle K} belongs to a maximal torus and that all maximal tori are conjugate. The maximal torus in a compact group plays a role analogous...
30 KB (4,472 words) - 20:43, 23 November 2024
Zero ring (category Short description matches Wikidata)
is also the unit ideal, equal to the whole ring. This ideal is neither maximal nor prime. The zero ring is generally excluded from fields, while occasionally...
6 KB (774 words) - 00:21, 24 September 2024
Homogeneous polynomial (category Short description matches Wikidata)
number of different monomials of degree d in n variables (that is the maximal number of nonzero terms in a homogeneous polynomial of degree d in n variables)...
6 KB (1,039 words) - 10:10, 2 March 2025
Principal ideal domain (category Short description matches Wikidata)
all unital rings, maximal ideals are prime. In principal ideal domains a near converse holds: every nonzero prime ideal is maximal. All principal ideal...
10 KB (1,455 words) - 17:26, 4 June 2025
Ultrafilter (category Short description matches Wikidata)
{\textstyle P} is a certain subset of P , {\displaystyle P,} namely a maximal filter on P ; {\displaystyle P;} that is, a proper filter on P {\textstyle...
20 KB (2,961 words) - 10:34, 22 May 2025
Maximum entropy probability distribution (category Short description matches Wikidata)
into the distribution; second, many physical systems tend to move towards maximal entropy configurations over time. If X {\displaystyle X} is a continuous...
36 KB (4,495 words) - 18:46, 19 June 2025
I-adic topology (category Short description matches Wikidata)
a polynomial ring over a field k and 𝔞 = (x1, ..., xn) the (unique) homogeneous maximal ideal. Then R ^ = k [ [ x 1 , … , x n ] ] {\displaystyle {\hat...
5 KB (651 words) - 23:04, 7 May 2025
{\displaystyle q} can be simulated by p {\displaystyle p} . Similarity is thus the maximal symmetric subset of the simulation preorder, which means it is reflexive...
6 KB (819 words) - 13:55, 20 March 2024
Residue field (category Short description matches Wikidata)
R} is a local ring and m {\displaystyle {\mathfrak {m}}} is then its unique maximal ideal. In abstract algebra, the splitting field of a polynomial is constructed...
6 KB (886 words) - 22:18, 26 March 2025
Misra & Gries edge-coloring algorithm (category Short description matches Wikidata)
that goes through vertex X, only contains edges colored c or d, and is maximal. (We cannot add any other edge with color c or d to the path.) If neither...
11 KB (1,595 words) - 02:00, 20 June 2025
Bouissons. April 1, 2014. Retrieved January 10, 2016. "Maximal Vanilla Zero Zucker" [Maximal Vanilla Zero Sugar]. pepsi.de (in German). Archived from...
19 KB (1,508 words) - 22:07, 26 June 2025