This study focuses on an alignment-free sequence comparison method: the number of words of length k shared between two sequences, also known as the D2 statistic. The advantages of the use of this statistic over alignment-based methods are firstly that it does not assume that homologous segments are contiguous, and secondly that the algorithm is computationally extremely fast, the runtime being proportional to the size of the sequence under scrutiny. Existing applications of the D2 statistic include the clustering of related sequences in large EST databases such as the STACK database. Such applications have typically relied on heuristics without any statistical basis. Rigorous statistical characterisations of the distribution of D2 have subs...
Motivation: Recently, a range of new statistics have become available for the alignment-free compari...
Next-generation sequencing (NGS) technologies have generated enormous amounts of shotgun read data, ...
The use of k-word matches was developed as a fast alignment-free comparison method for dna sequences...
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 ...
k-word matches, the number of words of length k shared between two sequences, also known as the D2 s...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
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...
Word matches are often used in sequence comparison methods, either as a measure of sequence similari...
Word matches are often used in sequence comparison methods, either as a measure of sequence similari...
Given two sequences of length n over a finite alphabet A of size \A\ = d, the D2 statistic is the nu...
BACKGROUND: The number of k-words shared between two sequences is a simple and effcient alignment-f...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
Word match counts have traditionally been proposed as an alignment-free measure of similarity for bi...
Motivation: Recently, a range of new statistics have become available for the alignment-free compari...
Next-generation sequencing (NGS) technologies have generated enormous amounts of shotgun read data, ...
The use of k-word matches was developed as a fast alignment-free comparison method for dna sequences...
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 ...
k-word matches, the number of words of length k shared between two sequences, also known as the D2 s...
The D2 statistic is defined as the number of word matches of prespecified length k, with up to t mis...
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...
Word matches are often used in sequence comparison methods, either as a measure of sequence similari...
Word matches are often used in sequence comparison methods, either as a measure of sequence similari...
Given two sequences of length n over a finite alphabet A of size \A\ = d, the D2 statistic is the nu...
BACKGROUND: The number of k-words shared between two sequences is a simple and effcient alignment-f...
The D2 statistic, defined as the number of matches of words of some pre-specified length k, is a com...
Word match counts have traditionally been proposed as an alignment-free measure of similarity for bi...
Motivation: Recently, a range of new statistics have become available for the alignment-free compari...
Next-generation sequencing (NGS) technologies have generated enormous amounts of shotgun read data, ...
The use of k-word matches was developed as a fast alignment-free comparison method for dna sequences...