n permute k by Eydrian

Based on Matt Fig's npermutek this function returns all possible permutations of most matlab classes (mathematics, statistics, combinatorics)

npermutek.m

An Approximation Solution for the Prize-Collecting Steiner Tree Problem by Fangzhou Chen

A function giving feasible(not optimal) solutions to the Prize-Collecting Steiner Tree Problem (algorithm, optimization, combinatorics)

FindTree(G, vp)

PCSTr(G, vp, r)

probOfStreak by Jeff Evans

Calculate the probability of a run or streak of K consecutive successes in N Bernoulli trials. (probability, combinatorics, run)

probOfStreak(N,K,p)

N_PERMUTE_K by Matt Fig

All possible permutations of the elements of set N, taken K at a time, with repetition. (c, combinations, multisets)

npermutek(N,K)

Generalised Truth Tables by Richard Stapenhurst

Generate 'truth tables' where columns correspond to digits in arbitrary mixtures of bases. (truth table, combinatorics, counting)

ttable(values)

Enumerate outcomes of Sampling without order, but with replacement by Jonathan Epperl

Draw k times from {1,2,..,n}, but return each drawn element -- which unique combinations are there? (combinatorics, sampling with replace...)

nreplacek(n,k)

A Jacobi Auction Algorithm Implementation (simple) by Pieter Reyneke

As introduced by Vickery (1961), Bertsekas (1979) refined by Demange, Gale, Sotomayor (1980's). (aerospace, image processing, mathematics)

auction( w, iter, e, verbose )

Permsnonindentical by David Holdaway

lists all nonidentical permutations of a set of numbers i.e. [1,1,2] go to [1,1,2;1,2,1;2,1,1] (combinatorics)

permsnonidentical( v,siphon )

BINOMIALPDF : Binomial Probability Density function by Bruce Raine

BINOMIALPDF Returns the probability that X = k in sample n. (binomial probability ..., statistics, combinatorics)

binomialpdf(n,k,p,Xtype)

binomind(n,k,speed)

Integer partitions by Hin Kwan Wong

Finds all partitions of a set containing homogenous elements, also called integer partitions. (combinations, combinatorics, combinatorial)

intpartitions(intIn)

Combinations, n choose k by Bruce Raine

This function finds the combinations of n choose k. (combinatorics, statistics)

m=mycombnk(n,k)

Roots of Cluster Polynomial representation of n-ary patterns by Theophanes Raptis

The package provides methods for computing the roots of cluster polynomials (symbolic sequences, discrete mathematics, combinatorics)

BLLSG( s, n )

NLLSG(s, n, b)

binroots(n, l, char)

Generate Exhaustive Permutations by Michael Chan

Illustrates generation of exhaustive permutation of symbols given the symbolic bases. (bioinformatics, permutation, combinatorics)

computePermutationSeqForSpecificIndex (bases, lengthOfPermu...

convertIndexRepresentedPermutationsToSymbolPermutations (ma...

generateExhaustivePermutation(bases, lengthOfPermutation)

Integer Partitions via Universal Lexicons by Theophanes Raptis

A new method for Integer Partitions in N Urns through Cluster Polynomials (discrete mathematics, combinatorics, signal processing)

BLLSG( s, n )

[c,cd]=clusterindex(s)

[cv,cd]=clusterindex(s)

Random Regular generator by golan pundak

creates a random regular graph in the pairing model (graphs, combinatorics, mathematics)

createRandRegGraph(vertNum, deg)

test.m

Motif Finding by Michael Chan

Illustrates Combinatorial and Viterbi-akin motif finding. (bioinformatics, probabilistic, combinatorics)

PWM( alignmentSetMatrix )

computeNewPWM_GivenSeqBasedOnPWM (alignmentSetMatrix, motif...

computeProbabilityOfSubsequence(sequenceToBeChecked, probab...

COMBINATOR -combinations AND permutations by Matt Fig

Returns 1 of 4 different samplings on the set 1:N, taken K at a time. (combinations, combinatorics, set)

combinator(N,K,s1,s2)

cumsumall.m

nsumk by Peter Cotton

Returns the number and listing of n-tuples of non-negative integers adding up to k. (nchoosek, polynomial, moments)

nsumk(n,k)

Unique random permutations by Ged Ridgway

Random sample (without replacement) from unique permutations of a vector or row-perms of a matrix (unique, random, permutation)

nchoosek_m(n, k, m)

perms_m(n, m)

sample_no_repl(n, k)

Solutions to the Soma Cube by Bill McKeeman

The 240 unique solutions to the Soma Cube. (puzzle, soma cube, combinatorics)

somasol()

NFACTORK by Matt Fig

Find all factorings of N which have K elements. (factor, divisors, primes)

nfactork(N,K)

Next Combination/Permutation by Matt Fig

Produces one comb/perm at a time. Both with/without repetition. (combinations, permutations, combinatorics)

nextchoose(N,K)

nextmultichoose(N,K)

nextperm(N,K)

PARTITIONS by Matt Fig

Finds all partitions of a set, or only those partitions of a specified length. Includes a viewer. (partition, restricted growth fun..., permutations)

partdisp(C,K)

partitions(M,K)

choose.m by Phillip M. Feldman

compute number of ways of choosing m objects from n distinct objects (choose, nchoosek, combinatorics)

choose(n, m)

domino tiles by ben payne

domino tiles random matrix, filling the matrix like in the game "snake" (communications, mathematics, measurement)

domino_matrix.m

nextcombi by Dan Stowell

Given a set of N items, iterate over all the combinations of size R (R<N) (combination, combinadic, combinatorics)

nextcombi(N, arr)

Log of factorial of large numbers by Yvan Lengwiler

computes log10 of the factorial (statistics, probability, factorial)

logfactorial(N,varargin)

Factorial of large numbers by Yvan Lengwiler

computes factorials of large arguments using standard algorithm (factorial, statistics, probability)

largefactorial(N,fmt)

enumBase2 by Shawn Mikula

Constructs a character or numeric array that enumerates from 0 to (2^n - 1) in binary. (statistics, probability, combinatorics)

enumBase2(n)