- AFS93.R. Agrawal, C. Faloutsos and A. Swami, "Efficient Similarity Search In Sequence Databases", FODO Conference, Evanston, Illinois, Oct., 93. Google ScholarDigital Library
- ALSS95.R. Agrawal, K.I. Lin, H.S. Sawhney and K. Shim, "Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases", Proe. of/he 21th VLDB Conf., 1995. Google ScholarDigital Library
- BKSS90.N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, "The/F'-tree: An Efficient and Robust Access Method forPoints and Rectangles", Proe. of the ACM SIGMOD Conf., 1990. Google ScholarDigital Library
- Bri95.S. Bdn, "Near Neighbor Search in Large Metric Spaces", VLDB Conf., 1995. Google ScholarDigital Library
- BYO97.T. Bozkaya, N. Yazdani, Z.M. Ozsoyoglu, "Matching and Indexing Sequences of Different Lengths'; Teeh. Report, CES, CWRU, 1997.Google Scholar
- CLR90.T.H. Cormen, C.E. Leiserson and R.L Rivest, "Introduction to Algorithms", MIT Press, 1990. Google ScholarDigital Library
- CR94.M. Crochemore and W. Rytter, '"i'ext Algorithms", Oxford Univ. Press, 1994. Google ScholarDigital Library
- Fuk72.IC Fukunaga, "Introduction to Statistical Pattern Recognition", Academic Press, New York, 1972. Google ScholarDigital Library
- FRM94.C. Faloutsos, M. Ranganathan and Y. Manolopoulos, "Fast Subsequence Matching in "lime-Series Databases", ACM SIGMOD Conf., 1994. Google ScholarDigital Library
- LT94.D. Lopresti, A. Tomkins, "On the Searehability of lectronic Ink", in IWFHR 94.Google Scholar
- LT95.D. Lopresti, A. Tomkins, "Block Edit Models for Approximate String Matching", in SSAWSP 95.Google Scholar
- SHB92.J. Snyder, A. Hiltner, E. Baer, "Analysis of the wedgeshaped damage zone in edge-notched polypropylen~", Jour. of Materials Sci. (27), 1992.Google Scholar
- Uhl91.J.K.Uhl mann, "Satisfying General Proximity/Similarity Queries with Mettle Trees", Information Processing Letters, v40, p175-179,1991.Google ScholarCross Ref
- YOO94.N. Yazdani, M. Ozsoyoglu and G. Ozsoyoglu, "A Framework For Feature-Based Indexing for Spatial Databases", Proceeding of 7'th Int. Conf. on Statistical and Scientific Database, 1994. Google ScholarDigital Library
- YO96.N. Yazdani and M. Ozsoyoglu "Sequence Matching of mages", Proceeding of 8'th Int. Conf. on Statistical and Scientific Database, 1996. Google ScholarDigital Library
Index Terms
- Matching and indexing sequences of different lengths
Recommendations
Exact FCFS Matching Rates for Two Infinite Multitype Sequences
Motivated by queues with multitype servers and multitype customers, we consider an infinite sequence of items of types C = {c1,...,cI}, and another infinite sequence of items of types S = {s1,...,sJ}, and a bipartite graph G of allowable matches between ...
New near perfect sequences of even lengths
This paper presents a new method of construction of near perfect sequences of even length N = 2 mn where m is an odd prime number and n = (2 J + 1), J is an even number. We use a shift sequence associated with a primitive polynomial of ...
Complete Complementary Sequences of Different Length
The class of complete complementary sequences (of fixed length) have the ideal correlation properties and are good at increasing the channel usage efficiency but lacks in desirable sequence lengths. In spread spectrum communication systems, sequences ...
Comments