Description Usage Arguments Details Value Note Author(s) References See Also Examples
Find a global alignment of a collection of sequences using the centerstartree heuristic.
1 2 3 4 
x 
a list (of vectors) or a vector of character. 
center 
a vector 
method 
argument to 
weight 
argument to 
exclude 
arguments to 
break.ties 
a logical specifying whether random tiebreaking should be performed. Otherwise the first alignment is used. 
transitive 
a logical specifying whether the sequences in

to.data.frame 
a logical specifying whether the result should
be converted to 
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.
Either a list of sequences with attributes center
and
ties
, or a data.frame
with the sequences in
the columns.
The global alignment may depend on the order of x
.
Christian Buchta
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.
1 2 3 4  ## continue example
x < c("ABCD", "AD", "BCD", "ACF", "CDF", "BC")
sdists.center.align(x)
sdists.center.align(x, transitive = TRUE, to.data.frame = TRUE)

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.