Palindrome pattern matching Constant query time for multiple

  • Slides: 12
Download presentation

§ Palindrome pattern matching § Constant query time for multiple patterns § Use a

§ Palindrome pattern matching § Constant query time for multiple patterns § Use a modified Aho-Corasick automaton.

§ 바이오 패턴 매칭에 사용되는 연산 및 유사성 불변량에 연관된 정규 언어의 연 구

§ 바이오 패턴 매칭에 사용되는 연산 및 유사성 불변량에 연관된 정규 언어의 연 구 § Pseudo-Inversion on Formal Languages (UCNC ‘ 14) § Non-overlapping Inversion on a Language (submitted to TCS) § 바이오 패턴 매칭을 위한 효율적인 알고리즘 디자인 § § § Alignment with Non-overlapping Inversions on Two Strings (WALCOM ‘ 14) Alignment with Non-overlapping Inversions and Translocations on Two Strings (accepted in TCS) Space-efficient Approximate String Matching Allowing Inversions in Fast Average Time (FAW ‘ 14) Online Multiple Palindrome Pattern Matching (SPIRE ‘ 14) Multiple Pattern Matching Allowing Inversions for Regular Language Pattern (in progress) § 바이오 데이터에 대한 빈발 패턴 마이닝 § Frequent Pattern Mining with Non-overlapping Inversions (accepted in LATA ‘ 15)