Linear Pattern Matching of Repeated Substring s Alejandro Lopez-Orti z Department of Computer Scienc e University of Waterlo o Waterloo, Out . N2L 3G1 Canad a e-mail : alopez-o@maytag . UWaterloo .ca 1 Introductio n In 1970, Knuth, Morris, and Pratt proposed their famous linear-time pattern matchin g algorithm for two strings . Their algorithm was derived from a result of Cook that 2-wa y deterministic pushdown languages are recognizable on a RAM in linear time [Co71] . In 1973 , Weiner [PeWe73] presented a very original algorithm that performs linear time recognitio n of repeated instances of a substring in a string . Weiner's approach to this problem was a s important as the solution to the problem itself . The relevance of his work was immediately appreciated . The result was announced in October, 1973 at what was then SWAT (now FOCS) and some selected ideas made their way to Section 9 .5 of the first edition of Aho , Hoperoft and Ullman's textbook [AHU74], published half a year later . Unfortunately, Weiner's paper may be difficult for modern readers . Familiar object s such as trees and other data structures are described using notation drawn
End of preview. The entire article is 8 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/linear-pattern-matching-of-repeated-substrings-7f8iMZ22AB
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Linear pattern matching of repeated substrings
López-Ortiz, Alejandro
Follow ACM SIGACT News
, Volume 25 (3)
Association for Computing Machinery – Sep 1, 1994
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
