89 search results - page 2 / 18 » Designing seeds for similarity search in genomic DNA |
SSDBM
2010
IEEE
13 years 9 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
ISMB
1996
13 years 6 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
BMCBI
2008
13 years 5 months ago
2008
Background: Modern proteomes evolved by modification of pre-existing ones. It is extremely important to comparative biology that related proteins be identified as members of the s...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
BMCBI
2006
13 years 4 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...