Genome comparison without alignment using shortest unique substrings
<p>Abstract</p> <p>Background</p> <p>Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection of unique genomic regions, can be accomplished efficiently without...
Main Authors: | Möller Friedrich, Pierstorff Nora, Haubold Bernhard, Wiehe Thomas |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2005-05-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/6/123 |
Similar Items
-
A Survey on Shortest Unique Substring Queries
by: Paniz Abedin, et al.
Published: (2020-09-01) -
Efficient Data Structures for Range Shortest Unique Substring Queries
by: Paniz Abedin, et al.
Published: (2020-10-01) -
More Time-Space Tradeoffs for Finding a Shortest Unique Substring
by: Hideo Bannai, et al.
Published: (2020-09-01) -
Simultaneous identification of long similar substrings in large sets of sequences
by: Wittig Burghardt, et al.
Published: (2007-05-01) -
How repetitive are genomes?
by: Wiehe Thomas, et al.
Published: (2006-12-01)