Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Kim, Dong Kyue
Kim, Yoo Ah
and
Park, Kunsoo
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
126.
Hua, Yufang
Jiang, Tao
and
Wu, Bin
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
221.
Sagot, Marie -France
1998.
LATIN'98: Theoretical Informatics.
Vol. 1380,
Issue. ,
p.
374.
Ziv-Ukelson, Michal
and
Kershenbaum, Aaron
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
34.
Akutsu, Tatsuya
and
Yagiura, Mutsunori
1998.
Automata, Languages and Programming.
Vol. 1443,
Issue. ,
p.
832.
Oskin, M.
Chong, F.T.
and
Sherwood, T.
1998.
Active Pages: a computation model for intelligent memory.
p.
192.
Fiutem, R.
and
Antoniol, G.
1998.
Identifying design-code inconsistencies in object-oriented software: a case study.
p.
94.
Gerstein, Mark
and
Levitt, Michael
1998.
Comprehensive assessment of automatic structural alignment against a manual standard, the scop classification of proteins.
Protein Science,
Vol. 7,
Issue. 2,
p.
445.
Baker, Brenda S.
and
Giancarlo, Raffaele
1998.
Algorithms — ESA’ 98.
Vol. 1461,
Issue. ,
p.
79.
Matias, Yossi
Muthukrishnan, S.
Sahinalp, Süleyman Cenk
and
Ziv, Jacob
1998.
Algorithms — ESA’ 98.
Vol. 1461,
Issue. ,
p.
67.
Stoye, Jens
and
Gusfield, Dan
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
140.
Wu, Bang Ye
Chao, Kun-Mao
and
Tang, Chuan Yi
1998.
Computing and Combinatorics.
Vol. 1449,
Issue. ,
p.
299.
Kececioglu, John D.
and
Zhang, Weiqing
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
189.
Mal, Bin
Wange, Lusheng
and
Lia, Ming
1998.
Combinatorial Pattern Matching.
Vol. 1448,
Issue. ,
p.
174.
Antoniol, G.
Canfora, G.
and
De Lucia, A.
1999.
Maintaining traceability during object-oriented software evolution: a case study.
p.
211.
Cohen, Jacques
1999.
The Logic Programming Paradigm.
p.
281.
Caprara, Alberto
1999.
Formulations and hardness of multiple sorting by reversals.
p.
84.
Kim, Sun
1999.
A new string-pattern matching algorithm using partitioning and hashing efficiently.
ACM Journal of Experimental Algorithmics,
Vol. 4,
Issue. ,
p.
2.
Kitajima, J.P.
and
Navarro, G.
1999.
A fast distributed suffix array generation algorithm.
p.
97.
Kurtz, Stefan
1999.
Reducing the space requirement of suffix trees.
Software: Practice and Experience,
Vol. 29,
Issue. 13,
p.
1149.