A recursive MISD architecture for pattern matching

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 12, Issue 7, 2004, Pages 727-734

  Halaas, Arne ^a   Svingen, Børge ^a   Nedland, Magnar ^b   Sætrom, Pål ^b   Snoøve Jr , Ola ^b   Birkeland, Olaf René ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b Interagon AS   (Norway)

Author keywords

Approximate search; Multiple instruction stream single data stream (MISD); Online pattern matching; Parallel architecture; VLSI

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CELLULAR ARRAYS; CMOS INTEGRATED CIRCUITS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; FUZZY SETS; VLSI CIRCUITS;

APPROXIMATE SEARCH; MULTIPLE INSTRUCTION STREAM-SINGLE DATA STREAM (MISD); ONLINE PATTERN MATCHING; PARALLEL ARCHITECTURE;

PATTERN MATCHING;

EID: 3142717350     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2004.830918     Document Type: Conference Paper

References (38)

1. G. Navarro and M. Raffinot, Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge, U.K.: Cambridge Univ. Press, 2002.
2. J. Friedl, Mastering Regular Expressions, 2nd ed. Cambridge, MA: O'Reilly, 2002.
3. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J. Kruskal, Eds., Addison-Wesley, Reading, MA, 1983.
4. W. Freeman, S. Walker, and K. Vrana, "Quantitative RT-PCR: pitfalls and potential," Biotechniques, vol. 26, no. 1, pp. 112-122, 1999.
5. S. Smith, W. Welch, A. Jakimcius, T. Dahlberg, E. Preston, and D. Dyke, "High throughput DNA sequencing using an automated electrophoresis analysis system and a novel sequence assembly program," Biotechniques, vol. 14, no. 6, pp. 1014-1018, 1993.
6. M. McManus and P. Sharp, "Gene silencing in mammals by small interfering RNAs," Nature Rev. Genetics, vol. 3, no. 10, pp. 737-747, 2002.
7. M. L. Hetland and P. Sætrom, "Temporal rule discovery using genetic programming and specialized hardware," in Proc. 4th int. Conf. Recent Advances in Soft Computing, 2002.
8. P. Særom and M. L. Hetland, "Unsupervised temporal rule mining with genetic programming and specialized hardware," in Proc. 2003 Int. Conf. Machine Learning and Applications (ICMLA'03), 2003, pp. 145-151.
9. G. Navarro, "A guided tour to approximate string matching," ACM Comput. Surveys, vol. 33, no. 1, pp. 31-88, 2001.
10. G. Stephen, String Searching Algorithms, Singapore: World Scientific, 1994.
11. P. Michailidis and K. Margaritis, "On-line approximate string searching algorithms: Survey and experimental results," Int. J. Comput. Math., vol. 79, no. 8, pp. 867-888, 2002.
12. J. Kuri, G. Navarro, L. Me, and L. Heye, "A pattern matching based filter for audit reduction and fast detection of potential intrusions," in Proc. 3rd Int. Workshop Recent Advances in Intrusion Detection, LNCS, 2000, pp. 17-27.
13. N. Belkin and W. Croft, "Information filtering and information retrieval -2 sides of the same coin?," Commun. ACM, vol. 35, no. 12, pp. 29-38, 1992.
14. S. Altschul, T. Madden, A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D. Lipman, "Gapped blast and psi-blast: A new generation of protein database search programs," Nucleic Acids Res., vol. 25, pp. 3389-3402, 1997.
15. M. Perrone and L. Cooper, "When networks disagree: Ensemble methods for hybrid neural networks." in Neural Networks for Speech and Image Processing, R. Mammone, Ed. London, U.K.: Chapman & Hall, 1993, pp. 126-142.
16. M. Jordan and R. Jacobs, "Hierarchical Mixtures of Experts and the EM Algorithm," Univ. Calif. Berkeley, Berkeley, CA, Tech. Rep. AIM-1440, 1993.
17. M. J. Foster and H. T. Kung, "The design of special-purpose VLSI chips," Computer, vol. 13, no. 1, pp. 26-40, 1980.
18. A. Halaas, "A systolic VLSI matrix for a family of fundamental searching problems," Integration, VLSI J., vol. 1, no. 3, 1983.
19. H. Cheng and K. Fu, "VLSI architectures for string matching and pattern matching," PR, vol. 20, pp. 125-141, 1987.
20. H. Yamada, M. Hirata, H. Nagai, and K. Takahashi, "A high-speed string-search engine," IEEE J. Solid-State Circuits, vol. 22, pp. 829-834, Oct. 1987.
21. M. Hirata, H. Yamada, H. Nagai, and K. Takahashi, "A versatile data string-search VLSI," IEEE J. Solid-State Circuits, vol. 23, pp. 329-335, Apr. 1988.
22. A. Mukherjee, "Hardware algorithms for determining similarity between two strings," T-COMP, vol. 38, pp. 600-603, 1989.
23. A. Halaas, "Arguments and architectures for ASIC's in future information retrieval systems," in In Proc, IFIP Workshop Design & Test of ASICs, 1990.
24. M. E. Isenman and D. E. Shasha, "Performance and architectural issues for string matching," IEEE Trans. Computers, vol. 39, pp. 238-250, 1990.
25. V. W.-K. Mak, K. C. Lee, and O. Frieder, "Exploiting parallelism in pattern matching: An information retrieval application," ACM Trans Information Systems, vol. 9, pp. 52-74, Jan. 1991.
26. J. Park and K. George, "Efficient parallel hardware algorithms for string matching," Microprocessors and Microsystems, vol. 23, no. 3, pp. 155-168, 1999.
27. Y. Lin and J. Yeh, "A scalable and efficient systolic algorithm for the longest common subsequence problem," J. Inform. Sci. Eng., vol. 18, no. 4, pp. 519-532, 2002.
28. K.-I. Yu, S.-P. Hsu, and P. Otsubu, "The fast data finder - An architecture for very high speed data search and dissemination," in Proc. 1st. Int. Conf. Data Engineering, 1984, pp. 167-174.
29. R. Sastry, N. Ranganathan, and K. Remedios, "Casm: A VLSI chip for approximate string-matching," PAMI, vol. 17, no. 8, pp. 824-830, Aug. 1995.
30. D. M. Dahle, J. D. Hirschberg, K. Karplus, H. Keller, E. Rice, D. Speck, D. H. Williams, and R. Hughey, "Kestrel: Design of an 8-bit SIMD parallel processor," in Proc. 17th Conf. Advanced Research in VLSI, 1997, pp. 145-162.
31. J. Hirschberg, D. Dahle, K. Karplus, D. Speck, and R. Hughey, "Kestrel: A programmable array for sequence analysis," J. VLSI Signal Processing Systems for Signal Image and Video Technol., vol. 19, no. 2, pp. 115-126, 1998.
32. J. Lindelien. "The Value of Accelerated Computing in Bioinformatics," Whitepaper. TimeLogic, Crystal Bay, NV. [Online]. Available: http://www.timelogic.com/whitepapers/decypher_benefits_e.pdf
33. H.-M. Blüthgen and T. G. Noll, "A programmable processor for approximate string matching with high throughput rate," in Proc. Int. Conf. Application-Specific Systems, Architectures, and Processors (ASAP'00), 2000, pp. 309-316.
34. B. Schmidt, H. Schroder, and M. Schimmler, "Protein sequence comparison on the instruction systolic array," in Proc. 6th Int. Conf., Parallel Computing Technologies, vol. 2127, Lecture Notes in Computer Science, V. E. Malyshkin, Ed., Novosibirsk, Russia, Sept. 2001, pp. 498-509.
35. R. Hughey, "Parallel hardware for sequence comparison and alignment," CABIOS, vol. 12, no. 6, pp. 473-479, 1996.
36. M. Nedland, B. Svingen, and M. Hetland. (2002) "The Interagon Query Language - A User's Guide," Whitepaper. Interagon AS, Trondheim, Norway. [Online]. Available: http://www.interagon.com/pub/whitepapers/IQL.overview- latest.pdf
37. _, (2002) "The Interagon Query Language - A Reference Guide," Whitepaper. Interagon AS, Trondheim, Norway. [Online]. Available: http://www.interagon.com/pub/whitepapers/IQL.reference-latest.pdf
38. M. Amarzguioui, T. Holen, E. Babaie, and H. Prydz, "Tolerance for mutations and chemical modifications in a siRNA," Nucleic Acids Res., vol. 31, no. 2, pp. 589-595, 2003.