Package: SFS
Type: Package
Title: Similarity-First Search Seriation Algorithm
Version: 0.1.4
Date: 2019-05-06
Authors@R: c(
	   person("Matteo", "Seminaroti",
	          role = c("aut", "cph"),
		  email = "matteo.seminaroti@gmail.com"),
	   person("Utz-Uwe", "Haus", role = c("aut", "cre", "cph"),
	          email = "uhaus@cray.com"),
	   person("Monique", "Laurent", role = c("ctb"),
	          email = "monique.laurent@cwi.nl")
	)
Maintainer: Utz-Uwe Haus <uhaus@cray.com>
Description: 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. 
License: GPL-3
Encoding: UTF-8
Imports: Rcpp (>= 0.12.7)
Suggests: seriation
LinkingTo: Rcpp, RcppArmadillo
SystemRequirements: C++11
RoxygenNote: 6.1.1
NeedsCompilation: yes
Packaged: 2019-05-07 06:02:30 UTC; uhaus
Author: Matteo Seminaroti [aut, cph],
  Utz-Uwe Haus [aut, cre, cph],
  Monique Laurent [ctb]
Repository: CRAN
Date/Publication: 2019-05-07 07:30:04 UTC
Built: R 4.1.3; x86_64-w64-mingw32; 2023-04-17 14:33:48 UTC; windows
Archs: i386, x64
