powered by
Find a global alignment of a collection of sequences using the center-star-tree heuristic.
sdists.center.align(x, center, method = "ow", weight = c(1, 1, 0, 2), exclude = c(NA, NaN, Inf, -Inf), break.ties = TRUE, transitive = FALSE, to.data.frame = FALSE)
Either a list of sequences with attributes center and
center
ties, or a data.frame with the sequences in the columns.
ties
data.frame
a list (of vectors) or a vector of character.
a vector
argument to sdists.
sdists
arguments to sdists.
a logical specifying whether random tie-breaking should be performed. Otherwise the first alignment is used.
a logical specifying whether the sequences in x should be aligned with each other, too.
x
a logical specifying whether the result should be converted to data.frame.
Christian Buchta
Each component of x is aligned with center in turn such that the latter is aligned with all sequences processed so far.
If center is missing isdists.center is used to compute an initial center.
isdists.center
D. Gusfield (1997). Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Chapter XX.
sdists for computation of distances, sdists.center for computation of centroids.
sdists.center
## continue example x <- c("ABCD", "AD", "BCD", "ACF", "CDF", "BC") sdists.center.align(x) sdists.center.align(x, transitive = TRUE, to.data.frame = TRUE)
Run the code above in your browser using DataLab