Publication View

Finding Optimal Pairs of Cooperative and (2004)

Abstract
We consider the problem of discovering the optimal pair of substring patterns with bounded distance #, from a given set S of strings.

Publication details
Download http://citeseer.ist.psu.edu/704628.html
Source http://www.cs.uta.fi/~helmu/pubs/ds04.pdf.gz
Publisher unknown
Contributors The Pennsylvania State University CiteSeer Archives
Repository CiteSeer (United States)
Keywords Shunsuke Inenaga,Hideo Bannai,Heikki Hyyro,Ayumi Shinohara,Masayuki Takeda,Kenta Nakai,Satoru Miyano Finding Optimal Pairs of Cooperative and
Language Englisch
Relation oai:CiteSeerPSU:108119, oai:CiteSeerPSU:386924, oai:CiteSeerPSU:472464, oai:CiteSeerPSU:617948, oai:CiteSeerPSU:700625, oai:CiteSeerPSU:329429, oai:CiteSeerPSU:593679, oai:CiteSeerPSU:576918, oai:CiteSeerPSU:570923, oai:CiteSeerPSU:346677, oai:CiteSeerPSU:568553