An implementation of the SimilarityFirst Search algorithm (SFS), a combinatorial algorithm which can be used to solve the seriation problem and to recognize some structured weighted graphs. The SFS algorithm represents a generalization to weighted graphs of the graph search algorithm Lexicographic BreadthFirst Search (LexBFS), a variant of BreadthFirst Search. The SFS algorithm reduces to LexBFS when applied to binary matrices (or, equivalently, unweighted graphs). Hence this library can be also considered for LexBFS applications such as recognition of graph classes like chordal or unit interval graphs. In fact, the SFS seriation algorithm implemented in this package is a multisweep algorithm, which consists in repeating a finite number of SFS iterations (at most n sweeps for a matrix of size n). If the data matrix has a Robinsonian structure, then the ranking returned by the multistep SFS algorithm is a Robinson ordering of the input matrix. Otherwise the algorithm can be used as a heuristic to return a ranking partially satisfying the Robinson property.
Package details 


Author  Matteo Seminaroti [aut, cph], UtzUwe Haus [aut, cre, cph], Monique Laurent [ctb] 
Maintainer  UtzUwe Haus <uhaus@cray.com> 
License  GPL3 
Version  0.1.4 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.