JCB
2008
13 years 11 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
ICWS
2004
IEEE
14 years 25 days ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
WEBI
2004
Springer
14 years 4 months ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
WWW
2004
ACM
15 years 4 days ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...