Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

FUIN
2006

favoriteEmaildiscussreport

47views more FUIN 2006»

A Low-complexity Distance for DNA Strings

13 years 4 months ago

A Low-complexity Distance for DNA Strings

Download funinf.cs.unibuc.ro

We exhibit a low-complexity but non-trivial distance for strings to be used in biology.

Liviu Petrisor Dinu, Andrea Sgarro

Real-time Traffic

FUIN 2006 | Non-trivial Distance |

claim paper

Related Content

» Complexity Estimation of Genetic Sequences Using InformationTheoretic and Frequency Analys...

» Approximate String Matching in LDAP Based on Edit Distance

» Selection of DNA Markers

» RMESH Algorithms for Parallel String Matching

» Privacy preserving error resilient dna searching through oblivious automata

» SimilarityBased Neural Networks for Applications in Computational Molecular Biology

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» DSIM A DistanceBased Indexing Method for Genomic Sequences

» Parameterized Intractability of Distinguishing Substring Selection

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FUIN
Authors	Liviu Petrisor Dinu, Andrea Sgarro

Comments (0)