Sciweavers

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

89

Voted

JDA
2010

107views more JDA 2010»

The longest common extension problem revisited and applications to approximate string searching

15 years 1 months ago

The longest common extension problem revisited and applications to approximate string searching

Download www.csd.uwo.ca

Lucian Ilie, Gonzalo Navarro, Liviu Tinta

Real-time Traffic

JDA 2010 |

claim paper

Related Content

» Restricted LCS

» LCS Approximation via Embedding into Local Nonrepetitive Strings

» SpaceConstrained GramBased Indexing for Efficient Approximate String Search

» Approximate String Matching in LDAP Based on Edit Distance

» Approximate String Matching with LempelZiv Compressed Indexes

» Efficient topk algorithms for fuzzy search in string collections

» Fast Algorithms for Sorting and Searching Strings

» Costbased variablelengthgram selection for string collections to support approximate queri...

» Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JDA
Authors	Lucian Ilie, Gonzalo Navarro, Liviu Tinta

Comments (0)