Motivation: Recently, a range of new statistics have become available for the alignment-free comparison of two sequences based on k-tuple word content. Here, we extend these statistics to the simultaneous comparison of more than two sequences. Our suite of statistics contains, first, C-l* and C-l(S), extensions of statistics for pairwise comparison of the joint k-tuple content of all the sequences, and second, (C-2*) over bar, <(C-2(S))over bar> and <(C-2(geo))over bar>, averages of sums of pairwise comparison statistics. The two tasks we consider are, first, to identify sequences that are similar to a set of target sequences, and, second, to measure the similarity within a set of sequences. Results: Our investigation uses bo...
Background Multiple sequence alignment is the foundation of many important applications in bioinfor...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
MOTIVATION: Recently, a range of new statistics have become available for the alignment-free compari...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
Alignment-free sequence comparison is widely used for comparing gene regulatory regions and for iden...
k-word matches, the number of words of length k shared between two sequences, also known as the D2 s...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods are still in the early stages of development ...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
Background Multiple sequence alignment is the foundation of many important applications in bioinfor...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
MOTIVATION: Recently, a range of new statistics have become available for the alignment-free compari...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
Alignment-free sequence comparison is widely used for comparing gene regulatory regions and for iden...
k-word matches, the number of words of length k shared between two sequences, also known as the D2 s...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods can compute the pairwise similarity between a...
Motivation: Alignment-free sequence comparison methods are still in the early stages of development ...
This study focuses on an alignment-free sequence comparison method: the number of words of length k ...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
Background Multiple sequence alignment is the foundation of many important applications in bioinfor...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...