String Processing and Information Retrieval - 2005

Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array

Get your print report emailed

Enter your email and we can send you a printable report on this item. ( View sample )

Print report emailed

We'll send you a print report shortly at Unknown

Receive our monthly book update for this book

We will send you an email each month containing links to all the book updates you subscribe to. This will keep informed of all the activity around your favourite books.

Subscribed

You will now receive reports at unknown email address

Share this page with others

You can share this item across the most popular social networks.

Click on the button below to purchase Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array

When you click on the button above, you will be redirected to springer.com where you can finish shopping.

String Processing and Information Retrieval

Crossref Citations Summary

Crossref Citations by year

No online mentions found

Mendeley readership by country

This chapter has 3 Mendeley readers. Click here to see more details on the Mendeley website.

Country %
France 1 33%
Unknown 2 67%

Mendeley readership by discipline

Discipline %
Computer Science 3 100%

Mendeley readership by professional status

Professional status %
Professor > Associate Professor 2 67%
Researcher 1 33%

SpringerLink Download summary

This chapter has been downloaded a total of 471 times.