13 search results - page 1 / 3 » A Low-complexity Distance for DNA Strings |
FUIN
2006
13 years 4 months ago
2006
We exhibit a low-complexity but non-trivial distance for strings to be used in biology.
INFORMATICALT
2010
13 years 3 months ago
2010
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
TSMC
2008
13 years 4 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
ISPAN
1997
IEEE
13 years 9 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...