Sciweavers

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

7

ISMB
2001

favoriteEmaildiscussreport

63views Computational Biology» more ISMB 2001»

An efficient algorithm for finding short approximate non-tandem repeats

13 years 6 months ago

An efficient algorithm for finding short approximate non-tandem repeats

Download www.covenantuniversity.com

Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann

Real-time Traffic

Computational Biology | ISMB 2001 |

claim paper

Related Content

» Finding approximate tandem repeats in genomic sequences

» A simpler and more efficient deterministic scheme for finding frequent items over sliding ...

» Using structure indices for efficient approximation of network properties

» Finding Motifs in a Database of Shapes

» A parallel and incremental algorithm for efficient unique signature discovery on DNA datab...

» Efficient approximate entity extraction with edit distance constraints

» Price Trackers Inspired by Immune Memory

» Distributed algorithms for ultrasparse spanners and linear size skeletons

» Towards a better solution to the shortest common supersequence problem the deposition and ...

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	ISMB
Authors	Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann

Comments (0)