CRAN/E | SFS

SFS

Similarity-First Search Seriation Algorithm

Installation

About

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.

Citation SFS citation info
System requirements C++11

Key Metrics

Version 0.1.4
Published 2019-05-07 1868 days ago
Needs compilation? yes
License GPL-3
CRAN checks SFS results

Downloads

Yesterday 0
Last 7 days 25 0%
Last 30 days 132 -30%
Last 90 days 464 -23%
Last 365 days 1.908 -23%

Maintainer

Maintainer

Utz-Uwe Haus

Authors

Matteo Seminaroti

aut / cph

Utz-Uwe Haus

aut / cre / cph

Monique Laurent

ctb

Material

README
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

SFS archive

Imports

Rcpp ≥ 0.12.7

Suggests

seriation

LinkingTo

Rcpp
RcppArmadillo