Package: SFS 0.1.4

Utz-Uwe Haus

SFS: Similarity-First Search Seriation Algorithm

An implementation of the Similarity-First 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 Breadth-First Search (Lex-BFS), a variant of Breadth-First Search. The SFS algorithm reduces to Lex-BFS when applied to binary matrices (or, equivalently, unweighted graphs). Hence this library can be also considered for Lex-BFS 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.

Authors:Matteo Seminaroti [aut, cph], Utz-Uwe Haus [aut, cre, cph], Monique Laurent [ctb]

SFS_0.1.4.tar.gz
SFS_0.1.4.tar.gz(r-4.5-noble)SFS_0.1.4.tar.gz(r-4.4-noble)
SFS_0.1.4.tgz(r-4.4-emscripten)SFS_0.1.4.tgz(r-4.3-emscripten)
SFS.pdf |SFS.html✨
SFS/json (API)

Peer review:

This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.

2 exports 1.90 score 2 dependencies 8 mentions 6 scripts 140 downloads

Last updated 5 years agofrom:59ead1b2ee. Checks:OK: 1 NOTE: 1. Indexed: yes.

Exports:readsfs

Dependencies:RcppRcppArmadillo