Guth, O., & Melichar, B. (2009). Searching All Seeds of Strings with Hamming Distance using Finite Automata. International MultiConference of Engineers & Computer Scientists 2009, 622.
Chicago Style (17th ed.) CitationGuth, Ondřej, and Bořivoj Melichar. "Searching All Seeds of Strings with Hamming Distance Using Finite Automata." International MultiConference of Engineers & Computer Scientists 2009 2009: 622.
MLA (9th ed.) CitationGuth, Ondřej, and Bořivoj Melichar. "Searching All Seeds of Strings with Hamming Distance Using Finite Automata." International MultiConference of Engineers & Computer Scientists 2009, 2009, p. 622.
Warning: These citations may not always be 100% accurate.