Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal:

Search In Journal Title:

Abbravation:

Search In Journal Abbravation:

Publisher

Springer, Berlin, Heidelberg

Search In Publisher:

DOI

10.1002/star.19800320703

Search In DOI:

ISSN

Search In ISSN:
Search In Title Of Papers:

Emphasis Type="SmallCaps"RISOTTO/Emphasis Fas

Authors: Nadia Pisanti Alexandra M Carvalho Laurent Marsan MarieFrance Sagot
Publish Date: 2006/3/20
Volume: , Issue: , Pages: 757-768
PDF Link

Abstract

We present in this paper an exact algorithm for motif extraction Efficiency is achieved by means of an improvement in the algorithm and data structures that applies to the whole class of motif inference algorithms based on suffix trees An average case complexity analysis shows a gain over the best known exact algorithm for motif extraction A full implementation was developed and made available online Experimental results show that the proposed algorithm is more than two times faster than the best known exact algorithm for motif extraction


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


    Search Result: