Finding patterns with variable length gaps or don't cares

M. Sohel Rahman; Costas S. Iliopoulos; Inbok Lee; Manal Mohamed; William F. Smyth

Finding patterns with variable length gaps or don't cares

M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

38 Citations (Scopus)

Abstract

In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n+m+alpha log(max(1

Original language	English
Title of host publication	Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06)
Place of Publication	BERLIN
Publisher	Springer
Pages	146-155
Number of pages	10
ISBN (Print)	0302-9743
Publication status	Published - 2006

Publication series

Name	LECTURE NOTES IN COMPUTER SCIENCE

Cite this

@inbook{4984107c4d6f4988b0f3f65a6934992a,

title = "Finding patterns with variable length gaps or don't cares",

abstract = "In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n+m+alpha log(max(1 ",

author = "Rahman, {M. Sohel} and Iliopoulos, {Costas S.} and Inbok Lee and Manal Mohamed and Smyth, {William F.}",

year = "2006",

language = "English",

isbn = "0302-9743",

series = "LECTURE NOTES IN COMPUTER SCIENCE",

publisher = "Springer",

pages = "146--155",

booktitle = "Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06)",

}

Finding patterns with variable length gaps or don't cares. / Rahman, M. Sohel ; Iliopoulos, Costas S.; Lee, Inbok et al.
Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06). BERLIN: Springer, 2006. p. 146-155 (LECTURE NOTES IN COMPUTER SCIENCE).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

TY - CHAP

T1 - Finding patterns with variable length gaps or don't cares

AU - Rahman, M. Sohel

AU - Iliopoulos, Costas S.

AU - Lee, Inbok

AU - Mohamed, Manal

AU - Smyth, William F.

PY - 2006

Y1 - 2006

N2 - In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n+m+alpha log(max(1

AB - In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n+m+alpha log(max(1

M3 - Conference paper

SN - 0302-9743

T3 - LECTURE NOTES IN COMPUTER SCIENCE

SP - 146

EP - 155

BT - Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06)

PB - Springer

CY - BERLIN

ER -

Finding patterns with variable length gaps or don't cares

Abstract

Publication series

Fingerprint

Cite this