Search results for "subsequences"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
78	Jianyong Wang 0001, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal	CONTOUR: an efficient algorithm for discovering discriminating subsequences.	Data Min. Knowl. Discov.	2009	DBLP DOI BibTeX RDF	Discriminating subsequence, Summarization subsequence, Clustering, Sequence mining
68	Yoshiki Yamaguchi, Tsutomu Maruyama, Fumikazu Konishi, Akihiko Konagaya	High speed tablation system using an FPGA designed for distribution tables of frequent DNA subsequences.	FPL	2007	DBLP DOI BibTeX RDF
55	Peter Krusche, Alexander Tiskin	New algorithms for efficient parallel string comparison.	SPAA	2010	DBLP DOI BibTeX RDF	BSP algorithms, longest increasing subsequences, longest common subsequences
53	Ming-Der Shieh, Hsin-Fu Lo, Ming-Hwa Sheu	High-speed generation of LFSR signatures.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	high-speed generation, LFSR signatures, compaction simulation, single-input signature register, equivalent multiple-input implementation, finite field theory, high-speed signature computations, lookahead technique, internal-XOR LFSR, external-XOR LFSR, performance evaluation, logic testing, built-in self test, integrated circuit testing, automatic test pattern generation, BIST, linear feedback shift register, binary sequences, subsequences
50	Zdenek Tronícek	Problems Related to Subsequences and Supersequences.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	supersequence, Directed Acyclic Supersequence Graph, seaching subsequences, subsequence
50	Gerardo Perez, Yuridia P. Mejia, Iván Olmos, Jesus A. Gonzalez, Patricia Sánchez, Candelario Vázquez	An Automaton for Motifs Recognition in DNA Sequences.	MICAI	2009	DBLP DOI BibTeX RDF
50	Xu Zhang, Tamer Kahveci	QOMA2: Optimizing the alignment of many sequences.	BIBE	2007	DBLP DOI BibTeX RDF
48	Hugues Mercier, Majid Khabbazian, Vijay K. Bhargava	On the Number of Subsequences When Deleting Symbols From a String.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
48	Akihiro Inokuchi, Takashi Washio	A Fast Method to Mine Frequent Subsequences from Graph Sequence Data.	ICDM	2008	DBLP DOI BibTeX RDF
48	Machiko Toyoda, Yasushi Sakurai, Toshikazu Ichikawa	Identifying Similar Subsequences in Data Streams.	DEXA	2008	DBLP DOI BibTeX RDF
48	Bing Yang 0001, Jing Chen 0020, Enyue Lu, S. Q. Zheng 0001	A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences.	TAMC	2007	DBLP DOI BibTeX RDF	algorithm, complexity, approximation, NP-complete, permutation, monotone, subsequence
48	Eamonn J. Keogh, Jessica Lin 0001	Clustering of time-series subsequences is meaningless: implications for previous and future research.	Knowl. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Data mining, Clustering, Time series, Rule discovery, Subsequence
48	Linhui Jiang	A Quick Look at Methods for Mining Long Subsequences.	AI	2003	DBLP DOI BibTeX RDF
48	Eitan Bachmat	Average case analysis for batched disk scheduling and increasing subsequences.	STOC	2002	DBLP DOI BibTeX RDF
48	Karl Entacher	Bad Subsequences of Well-Known Linear Congruential Pseudo-Random Number Generators.	ACM Trans. Model. Comput. Simul.	1998	DBLP DOI BibTeX RDF	parallel pseudorandom number generator, random number generation, stochastic simulation, linear congruential generator, spectral test, lattice structure
43	Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White	Reverse-Complement Similarity Codes.	GTIT-C	2006	DBLP DOI BibTeX RDF	code distance, rate of codes, insertion-deletion codes, similarity, codes, sequences, DNA sequences, subsequences
43	Wilfred J. Hansen	Subsequence References: First-Class Values for Substrings.	ACM Trans. Program. Lang. Syst.	1992	DBLP DOI BibTeX RDF	ATK, AUIS, Andrew Toolkit, Ness, sequences, strings, document processing, programming language design, subsequences, string searching, substrings
40	George S. Lueker	Improved bounds on the average length of longest common subsequences.	J. ACM	2009	DBLP DOI BibTeX RDF	Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
40	Eitan Bachmat	Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry.	Algorithmica	2007	DBLP DOI BibTeX RDF	Increasing subsequences, Spacetime geometry, Patience sorting, Disk scheduling
40	Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter	Image Retrieval Using the Longest Approximate Common Subsequences.	ICMCS, Vol. 2	1999	DBLP DOI BibTeX RDF	Longest approximate common subsequences, Line string, Image databases
40	Yujiun P. Wang, Theodosios Pavlidis	Optimal Correspondence of String Subsequences.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
40	Lianzi Wen, Toshiyuki Amagasa, Hiroyuki Kitagawa	An Approach for XML Similarity Join Using Tree Serialization.	DASFAA	2008	DBLP DOI BibTeX RDF
40	Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim	A Practical Method for Approximate Subsequence Search in DNA Databases.	PAKDD	2007	DBLP DOI BibTeX RDF	DNA database, approximate subsequence search, suffix tree
40	Sven Rahmann	Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.	CPM	2006	DBLP DOI BibTeX RDF
40	Siamak Rezaei, Md. Maruf Monwar	Divide-and-Conquer Algorithm for Clustalw-MPI.	CCECE	2006	DBLP DOI BibTeX RDF
40	Tak-Chung Fu, Fu-Lai Chung, Robert W. P. Luk, Chak-man Ng	Preventing Meaningless Stock Time Series Pattern Discovery by Changing Perceptually Important Point Detection.	FSKD (1)	2005	DBLP DOI BibTeX RDF
40	Shoji Hirano, Shusaku Tsumoto	Multiscale Comparison of Temporal Patternsin Time-Series Medical Databases.	PKDD	2002	DBLP DOI BibTeX RDF	multiscale matching, rough clustering, temporal knowledge discovery, rough sets, medical data mining
38	S. Vahid Jazayeri, Osmar R. Zaïane	Plant Protein Localization Using Discriminative and Frequent Partition-Based Subsequences.	ICDM Workshops	2008	DBLP DOI BibTeX RDF
38	Eamonn J. Keogh, Jessica Lin 0001, Ada Wai-Chee Fu, Helga Van Herle	Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications.	IEEE Trans. Inf. Technol. Biomed.	2006	DBLP DOI BibTeX RDF
38	Ho-Kwok Dai, Hung-Chi Su	A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.	LATIN	2006	DBLP DOI BibTeX RDF
38	Erdong Chen, Hao Yuan, Linji Yang	Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition.	ISAAC	2005	DBLP DOI BibTeX RDF
38	Sang-Wook Kim, Jeehee Yoon, Sanghyun Park 0003, Tae-Hoon Kim 0001	Shape-based retrieval of similar subsequences in time-series databases.	SAC	2002	DBLP DOI BibTeX RDF	shape-based retrieval, indexing, similarity search, time-series databases
38	Wolfgang Merkle	The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences.	ICALP	2002	DBLP DOI BibTeX RDF
38	Sanghyun Park 0003, Wesley W. Chu, Jeehee Yoon, Chih-Cheng Hsu	Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases.	ICDE	2000	DBLP DOI BibTeX RDF	Similarity Search, Suffix Tree, Time Warping, Sequence Database
38	Claus Rick	Efficient Computation of All Longest Common Subsequences.	SWAT	2000	DBLP DOI BibTeX RDF
38	Reuven Bar-Yehuda, Sergio Fogel	Partitioning a Sequence into Few Monotone Subsequences.	Acta Informatica	1998	DBLP DOI BibTeX RDF
35	Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi	Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences.	Algorithmica	2024	DBLP DOI BibTeX RDF
35	Andrzej Chmielowiec	Algorithm for error-free determination of the variance of all contiguous subsequences and fixed-length contiguous subsequences for a sequence of industrial measurement data.	Comput. Stat.	2021	DBLP DOI BibTeX RDF
33	Yoshinobu Higami, Yuzo Takamatsu, Kozo Kinoshita	Test sequence compaction for sequential circuits with reset states.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	reset states, test compaction method, single stuck-at fault assumption, unremovable vectors, fault-dropping fault simulation, nonfault-dropping fault simulation, reset signal, test subsequences, logic testing, fault detection, sequential circuits, sequential circuits, automatic test pattern generation, fault simulation, vectors, logic simulation, logic simulation, benchmark circuits, test vectors, signal detection, test sequence compaction
33	Hong Man, Faouzi Kossentini, Mark J. T. Smith	A Class of EZW Image Coders for Noisy Channels.	ICIP (3)	1997	DBLP DOI BibTeX RDF	EZW image coders, generalized image coding algorithm, embedded zerotree wavelet image coding, channel error resilience, channel error robustness, output bit sequence, source/channel coding algorithm, channel mismatching problem solution, bit stream, varying channel error conditions, fixed lenght codes, wavelet transforms, bit error rates, variable length codes, subsequences, noisy channels, compression performance
33	Mi Lu, Hua Lin	Parallel Algorithms for the Longest Common Subsequence Problem.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound
33	Sylvia C. Boyd, Hasan Ural	On the Complexity of Generating Optimal Test Sequences.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	maximal overlapping, test subsequences, optimal test sequence generation, OTSG problem, computational complexity, protocols, NP-complete, finite state machine, program testing, communications protocols, finite automata, polynomial time, FSM, protocol testing
30	Anne Denton, Christopher Besemann, Dietmar H. Dorr	Pattern-based time-series subsequence clustering using radial distribution functions.	Knowl. Inf. Syst.	2009	DBLP DOI BibTeX RDF	Time series subsequence clustering, Clustering noisy data, Time series labeling, Density-based clustering, Noise elimination
30	Lorenzo Favalli, Marco Folli	ILPS: A Scalable Multiple Description Coding Scheme for H.264.	FMN	2009	DBLP DOI BibTeX RDF	inter layer prediction, scalability, Multiple Description Coding, H.264/SVC
30	Kang Deng, Osmar R. Zaïane	Contrasting Sequence Groups by Emerging Sequences.	Discovery Science	2009	DBLP DOI BibTeX RDF	Emerging Sequences, Sequence Similarity, Classification
30	K. R. Seeja, Mohd. Afshar Alam, S. K. Jain	MotifMiner: A Table Driven Greedy Algorithm for DNA Motif Mining.	ICIC (2)	2009	DBLP DOI BibTeX RDF	Regulatory motif, Greedy approach, Motif discovery, Information content
30	Bing Yang 0001, Jing Chen 0020, Enyue Lu, Si-Qing Zheng	Design and Performance Evaluation of Sequence Partition Algorithms.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	monotone subsequence, permutation algorithm, complexity, approximation, NP-complete
30	Mohammed Al-Shalalfa, Reda Alhajj	Motif Location Prediction by Divide and Conquer.	BIRD	2008	DBLP DOI BibTeX RDF	conserved motifs, divide and conquer, gene expression data, sequence analysis, motif discovery
30	Yuan Lan, Yeng Chai Soh, Guang-Bin Huang	Extreme Learning Machine based bacterial protein subcellular localization prediction.	IJCNN	2008	DBLP DOI BibTeX RDF
30	Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta	An efficient data structure for applying multiple seeds in homology search.	BIBE	2007	DBLP DOI BibTeX RDF
30	Yu He, Xindong Wu 0001, Xingquan Zhu 0001, Abdullah N. Arslan	Mining Frequent Patterns with Wildcards from Biological Sequences.	IRI	2007	DBLP DOI BibTeX RDF
30	Fredrik Bengtsson, Jingsen Chen	Efficient Algorithms for k Maximum Sums.	Algorithmica	2006	DBLP DOI BibTeX RDF
30	Aiman H. El-Maleh, S. Saqib Khursheed, Sadiq M. Sait	Efficient Static Compaction Techniques for Sequential Circuits Based on Reverse-Order Restoration and Test Relaxation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
30	Carl Kingsford, Elena Zaslavsky, Mona Singh 0001	A Compact Mathematical Programming Formulation for DNA Motif Finding.	CPM	2006	DBLP DOI BibTeX RDF
30	Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann	On Minimum k-Modal Partitions of Permutations.	LATIN	2006	DBLP DOI BibTeX RDF	monotone sequence, k-modal sequence, cocoloring, approximation algorithm, online algorithm, Mixed integer program, hardness, LP rounding
30	Ming-Yen Lin, Suh-Yin Lee	Efficient mining of sequential patterns with time constraints by delimited pattern growth.	Knowl. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Pattern-growth, Data mining, Time constraint, Sequential patterns, Sequence mining
30	Aiman H. El-Maleh, S. Saqib Khursheed, Sadiq M. Sait	Efficient Static Compaction Techniques for Sequential Circuits Based on Reverse Order Restoration and Test Relaxation.	Asian Test Symposium	2005	DBLP DOI BibTeX RDF
30	Jingyi Yang, Jitender S. Deogun, Zhaohui Sun	A New Scheme for Protein Sequence Motif Extraction.	HICSS	2005	DBLP DOI BibTeX RDF
30	Zheng Liu 0001, Jeffrey Xu Yu, Xuemin Lin 0001, Hongjun Lu, Wei Wang 0011	Locating Motifs in Time-Series Data.	PAKDD	2005	DBLP DOI BibTeX RDF
30	Fredrik Bengtsson, Jingsen Chen	Efficient Algorithms for k Maximum Sums.	ISAAC	2004	DBLP DOI BibTeX RDF
30	Abdullah N. Arslan, Ömer Egecioglu	Algorithms for Local Alignment with Length Constraints.	LATIN	2002	DBLP DOI BibTeX RDF
30	Nico Jacobs, Hendrik Blockeel	The Learning Shell: Automated Macro Construction.	User Modeling	2001	DBLP DOI BibTeX RDF	interface adaptation, machine learning, inductive logic programming
30	Dimitrios Gunopulos, Gautam Das 0001	Time Series Similarity Measures and Time Series Indexing.	SIGMOD Conference	2001	DBLP DOI BibTeX RDF
30	Haixun Wang, Chang-Shing Perng	The S2-Tree : An Index Structure for Subsequence Matching of Spatial Objects.	PAKDD	2001	DBLP DOI BibTeX RDF
30	Irith Pomeranz, Sudhakar M. Reddy	Static Test Compaction for Scan-Based Designs to Reduce Test Application Time.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	scan circuits, test application time, static test compaction
30	Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Hong Lee, Chin-Wan Chung	Similarity Search for Multidimensional Data Sequences.	ICDE	2000	DBLP DOI BibTeX RDF	multidimensional data sequence, subsequence finding, similarity search, multimedia retrieval, video search
30	Karl Entacher	Parallel Streams of Linear Random Numbers in the Spectral Test.	ACM Trans. Model. Comput. Simul.	1999	DBLP DOI BibTeX RDF	leap-frog technique, long-range correlations, parallel random numbers, random number generation, stochastic simulation, linear congruential generator, spectral test, lattice structure
30	Irith Pomeranz, Sudhakar M. Reddy	Static Test Compaction for Scan-Based Designs to Reduce Test Application Time.	Asian Test Symposium	1998	DBLP DOI BibTeX RDF
28		Frequent Subsequences.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
28	Bolin Ding, David Lo 0001, Jiawei Han 0001, Siau-Cheng Khoo	Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database.	ICDE	2009	DBLP DOI BibTeX RDF
28	Yves Edel	Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G ).	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	AMS Classifications 11B50, 20K01, 51E22
28	Hui Wang 0001, Zhiwei Lin 0002	A Novel Algorithm for Counting All Common Subsequences.	GrC	2007	DBLP DOI BibTeX RDF
28	Bryant A. Julstrom, Brenda Hinkemeyer	Starting from Scratch: Growing Longest Common Subsequences with Evolution.	PPSN	2006	DBLP DOI BibTeX RDF	initially empty solutions, genetic algorithm, Longest common subsequence
28	Alexandre Tiskin	Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.	CPM	2006	DBLP DOI BibTeX RDF
28	Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz	Faster Algorithms for Computing Longest Common Increasing Subsequences.	CPM	2006	DBLP DOI BibTeX RDF
28	Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song	A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.	Euro-Par	2006	DBLP DOI BibTeX RDF
28	Philip Bille, Inge Li Gørtz	Matching Subsequences in Trees.	CIAC	2006	DBLP DOI BibTeX RDF
28	Abdullah N. Arslan, Ömer Egecioglu	Efficient Computation of Long Similar Subsequences.	SPIRE	2002	DBLP DOI BibTeX RDF	normalized local alignment, ratio maximization, approximation algorithm, dynamic programming, Local alignment
28	Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro 0001, Rodrigo Scheihing	Bounding the Expected Length of Longest Common Subsequences and Forests.	Theory Comput. Syst.	1999	DBLP DOI BibTeX RDF
28	Patricia A. Evans	Finding Common Subsequences with Arcs and Pseudoknots.	CPM	1999	DBLP DOI BibTeX RDF
28	Daniel S. Hirschberg	Bounds on the Number of String Subsequences.	CPM	1999	DBLP DOI BibTeX RDF
28	Tao Jiang 0001, Ming Li 0001	On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.	ICALP	1994	DBLP DOI BibTeX RDF
23	Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée	Hidden word statistics.	J. ACM	2006	DBLP DOI BibTeX RDF	De Bruijn graph, combinatorial calculus, complex asymptotics, discrete probability, distributional analysis, Pattern matching, languages, generating functions, words, subsequences
23	Ed Huai-hsin Chi, Peter Pirolli, James E. Pitkow	The scent of a site: a system for analyzing and predicting information scent, usage, and usability of a Web site.	CHI	2000	DBLP DOI BibTeX RDF	dome tree, longest repeated subsequences, usage-based layout, data mining, World Wide Web, usability, information visualization, information foraging, information scent
23	Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter	COQUINA: Content-Queryable Image and Signal Archives.	ICMCS, Vol. 2	1999	DBLP DOI BibTeX RDF	Longest approximate common subsequences, Line strings, Image databases
23	Walter F. Tichy	The String-to-String Correction Problem with Block Moves	ACM Trans. Comput. Syst.	1984	DBLP DOI BibTeX RDF	block moves, revision control, source control, string deltas, pattern matching, longest common subsequences, string edits
20	Feng Zhang 0011, Ran Tao 0003, Yue Wang 0001	Oversampling analysis in fractional Fourier domain.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	chirp signal, fractional Fourier transform, oversampling
20	Minghui Jiang 0001	Inapproximability of Maximal Strip Recovery.	ISAAC	2009	DBLP DOI BibTeX RDF
20	Yueguo Chen, Gang Chen 0001, Ke Chen 0005, Beng Chin Ooi	Efficient Processing of Warping Time Series Join of Motion Capture Data.	ICDE	2009	DBLP DOI BibTeX RDF
20	Lusheng Wang 0001, Binhai Zhu	On the Tractability of Maximal Strip Recovery.	TAMC	2009	DBLP DOI BibTeX RDF
20	Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan Cheng 0004, Ke Xu 0001	Mining Compressed Repetitive Gapped Sequential Patterns Efficiently.	ADMA	2009	DBLP DOI BibTeX RDF	repetitive gapped sequential pattern, compressing frequent patterns
20	Pratibha Rani, Vikram Pudi	RBNBC: Repeat Based Naive Bayes Classifier for Biological Sequences.	ICDM	2008	DBLP DOI BibTeX RDF
20	Peng Zou, Liang Su, Yan Jia 0001, Weihong Han, Shuqiang Yang	Fast similarity matching on data stream with noise.	ICDE Workshops	2008	DBLP DOI BibTeX RDF
20	Søren Riis	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity.	LICS	2008	DBLP DOI BibTeX RDF	Algebraic proof complexity, predicate logic, Propositional proof complexity
20	Jan Stola	Unimaximal Sequences of Pairs in Rectangle Visibility Drawing.	GD	2008	DBLP DOI BibTeX RDF
20	Necmiye Ozay, Mario Sznaier, Octavia I. Camps	Sequential sparsification for change detection.	CVPR	2008	DBLP DOI BibTeX RDF
20	Ji Tao, Yap-Peng Tan	Face clustering in videos using constraint propagation.	ISCAS	2008	DBLP DOI BibTeX RDF
20	Zhixiang Chen 0001, Bin Fu, Minghui Jiang 0001, Binhai Zhu	On Recovering Syntenic Blocks from Comparative Maps.	COCOA	2008	DBLP DOI BibTeX RDF
20	Eamonn J. Keogh, Jessica Lin 0001, Sang-Hee Lee, Helga Van Herle	Finding the most unusual time series subsequence: algorithms and applications.	Knowl. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Time series data mining, Clustering, Anomaly detection
20	Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, Irfan A. Essa	Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees.	ICCV	2007	DBLP DOI BibTeX RDF