Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
6	Rao Li	A space efficient algorithm for the constrained heaviest common subsequence problem.	ACM Southeast Regional Conference	2008	DBLP DOI BibTeX RDF	constrained heaviest common subsequence, constrained longest common subsequence, heaviest common subsequence, longest common subsequence
4	Panagiotis Papapetrou, Paul Doliotis, Vassilis Athitsos	Towards faster activity search using embedding-based subsequence matching.	PETRA	2009	DBLP DOI BibTeX RDF	embedding-based subsequence matching (EBSM), time series, embeddings, dynamic time warping, subsequence matching
4	Tae Sik Han, Seung-Kyu Ko, Jaewoo Kang	Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index.	MLDM	2007	DBLP DOI BibTeX RDF	Dual Match, Longest Common Subsequence, Subsequence matching
4	Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa	Online Construction of Subsequence Automata for Multiple Texts. (PDF / PS)	SPIRE	2000	DBLP DOI BibTeX RDF	online construction, subsequence automata, multiple texts, subsequence automaton, minimum automaton, online algorithm, preprocessing, deterministic finite automaton, deterministic automata, alphabet
4	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
3	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
3	Costas S. Iliopoulos, Mohammad Sohel Rahman	A New Efficient Algorithm for Computing the Longest Common Subsequence.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Algorithms, Strings, Longest common subsequence
3	Vit Niennattrakul, Chotirat Ann Ratanamahatana	Meaningful Subsequence Matching under Time Warping Distance for Data Stream.	PAKDD	2009	DBLP DOI BibTeX RDF	Dynamic Time Warping Distance, Data Stream, Normalization, Subsequence Matching
3	Jeff Pasternack, Dan Roth	Extracting article text from the web with maximum subsequence segmentation.	WWW	2009	DBLP DOI BibTeX RDF	maximum subsequence, page segmentation, text extraction
3	Jianyong Wang, 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
3	Todd Easton, Abhilash Singireddy	A large neighborhood search heuristic for the longest common subsequence problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Large neighborhood search, Dynamic programming, Heuristic, Longest common subsequence
3	Elham Parvinnia, Mohammad Taheri, Kourush Ziarati	An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.	BMEI	2008	DBLP DOI BibTeX RDF	Longest Common Subsequence (LCS), global alignment
3	Dennis Weyland	Simulated annealing, its parameter settings and the longest common subsequence problem.	GECCO	2008	DBLP DOI BibTeX RDF	longest common subsequence problem, simulated annealing, run time analysis
3	Krzysztof Fabjanski, Tomasz Kruk	Network Traffic Classification by Common Subsequence Finding.	ICCS	2008	DBLP DOI BibTeX RDF	common subsequence finding, bioinformatics algorithms, Clustal algorithm, Center Star method, automated generation of network attack signatures, anomaly detection, network intrusion detection systems, network traffic analysis
3	Vassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos	Approximate embedding-based subsequence matching of time series.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	filter-and-refine retrieval, similarity indexing, time series, embeddings, dynamic time warping, subsequence matching
3	Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu	Efficient algorithms for finding a longest common increasing subsequence.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Longest common increasing subsequence, Design and analysis of algorithms
3	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette	Exemplar Longest Common Subsequence.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	combinatorial algorithms, comparative genomics, Longest common subsequence, algorithm design and analysis, analysis of algorithms and problem complexity
3	Thomas Jansen, Dennis Weyland	Analysis of evolutionary algorithms for the longest common subsequence problem.	GECCO	2007	DBLP DOI BibTeX RDF	longest common subsequence problem, crossover, run time analysis
3	Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park, 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
3	Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister	A geometric framework for solving subsequence problems in computational biology efficiently.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	quasiconvex functions, subsequence problems, computational biology, Minkowski sums
3	Abdullah N. Arslan	A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.	FCT	2007	DBLP DOI BibTeX RDF	common subsequence, multi-dimensional string, dynamic programming, image, NP
3	Brenda Hinkemeyer, Bryant A. Julstrom	A genetic algorithm for the longest common subsequence problem.	GECCO	2006	DBLP DOI BibTeX RDF	genetic algorithm, strings, longest common subsequence
3	Clifford K. F. So, George Baciu	Hypercube sweeping algorithm for subsequence motion matching in large motion databases.	VRCIA	2006	DBLP DOI BibTeX RDF	motion capture animation, multi-dimensional time-series data, non-uniform time-warping, subsequence matching
3	Bing Liu 0009, Jianjun Xu, Zhihui Wang, Wei Wang 0009, Baile Shi	Subsequence Similarity Search Under Time Shifting.	RSKT	2006	DBLP DOI BibTeX RDF	Similarity search, subsequence, time shifting
3	Wei Liu, Yixin Chen, Ling Chen, Ling Qin	A Fast Parallel Longest Common Subsequence Algorithm Based on Pruning Rules.	IMSCCS	2006	DBLP DOI BibTeX RDF	identical character pair, Bioinformatics, longest common subsequence
3	David Semé	A CGM Algorithm Solving the Longest Increasing Subsequence Problem.	ICCSA	2006	DBLP DOI BibTeX RDF	Longest Increasing Subsequence, Parallel Algorithms, Coarse Grained Multicomputers
3	Dina Q. Goldin, Ricardo Mardales, George Nagy	In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure.	CIKM	2006	DBLP DOI BibTeX RDF	K-means subsequence clustering, cluster shape distance, meaningless
3	Panagiotis D. Michailidis, Konstantinos G. Margaritis	New Processor Array Architectures for the Longest Common Subsequence Problem.	The Journal of Supercomputing	2005	DBLP DOI BibTeX RDF	longest common subsequence problem, parallel algorithms, VLSI, parallel architectures, linear processor arrays
3	Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	What Makes the Arc-Preserving Subsequence Problem Hard?	T. Comp. Sys. Biology	2005	DBLP DOI BibTeX RDF	Arc-Preserving Subsequence problem, Computational complexity, RNA structures
3	Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	What Makes the Arc-Preserving Subsequence Problem Hard?	International Conference on Computational Science	2005	DBLP DOI BibTeX RDF	Arc-Preserving Subsequence, Computational complexity, RNA structures
3	Rong Liu, Sheqin Dong, Xianlong Hong	Fixed-outline floorplanning based on common subsequence.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	common subsequence, floorplanning, fixed-outline
3	Sang-Wook Kim, Byeong-Soo Jeong	Performance bottleneck in time-series subsequence matching.	SAC	2005	DBLP DOI BibTeX RDF	optimization, time-series databases, subsequence matching, performance bottleneck
3	Man-Soon Kim, Sang-Wook Kim, Miyoung Shin	Optimization of subsequence matching under time warping in time-series databases.	SAC	2005	DBLP DOI BibTeX RDF	time warping, time-series databases, subsequence matching
3	Hyun-Gil Koh, Woong-Kee Loh, Sang-Wook Kim	An Efficient Subsequence Matching Method Based on Index Interpolation.	IEA/AIE	2005	DBLP DOI BibTeX RDF	index interpolation, window size effect, time-series database, subsequence matching
3	Woong-Kee Loh, Sang-Wook Kim, Kyu-Young Whang	A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases.	Data Min. Knowl. Discov.	2004	DBLP DOI BibTeX RDF	normalization transform, index interpolation, time-series databases, subsequence matching
3	Francisco Nivando Bezerra	A Longest Common Subsequence Approach to Detect Cut and Wipe Video Transitions.	SIBGRAPI	2004	DBLP DOI BibTeX RDF	video transition detection, video slice, longest common subsequence
3	Carlos E. R. Alves, Edson Cáceres, Siang W. Song	A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.	IPDPS	2003	DBLP DOI BibTeX RDF	Parallel algorithms, LCS, longest common subsequence, BSP, CGM
3	Woong-Kee Loh, Sang-Wook Kim	A subsequence matching algorithm supporting moving average transform of arbitrary order in time-series databases using index interpolation.	ADC	2001	DBLP DOI BibTeX RDF	index interpolation, moving average transform, time-series databases, subsequence matching
3	Michael S. Hsiao, Srimat T. Chakradhar	Test Set Compaction Using Relaxed Subsequence Removal.	J. Electronic Testing	2000	DBLP DOI BibTeX RDF	static test set compaction, support sets, recurrence subsequence, ATPG
3	Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang	The Longest Common Subsequence Problem for Arc-Annotated Sequences.	CPM	2000	DBLP DOI BibTeX RDF	Sequence annotation, approximation algorithm, dynamic programming, longest common subsequence, maximum independent set, MAX SNP-hard
3	Lasse Bergroth, Harri Hakonen, Timo Raita	A Survey of Longest Common Subsequence Algorithms. (PDF / PS)	SPIRE	2000	DBLP DOI BibTeX RDF	longest common subsequence algorithms, string comparison, data structures, string matching, string matching, execution time, algorithm performance
3	Yen-Chun Lin, Jyh-Chian Chen	An Efficient Systolic Algorithm for the Longest Common Subsequence Problem.	The Journal of Supercomputing	1998	DBLP DOI BibTeX RDF	parallel algorithm, VLSI, systolic array, multicomputer, Longest common subsequence
3	Michael S. Hsiao, Srimat T. Chakradhar	State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits.	DATE	1998	DBLP DOI BibTeX RDF	test set compaction, state relaxation, recurrence subsequence removal, sequential circuit
3	Mi Lu, Hua Lin	Parallel Algorithms for the Longest Common Subsequence Problem.	IEEE Trans. Parallel Distrib. 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
2	Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Seung-won Hwang, Hwanjo Yu	A new approach for processing ranked subsequence matching based on ranked union.	SIGMOD Conference	2011	DBLP DOI BibTeX RDF
2	Heng Tao Shen, Jie Shao, Zi Huang, Xiaofang Zhou	Effective and Efficient Query Processing for Video Subsequence Identification.	IEEE Trans. Knowl. Data Eng.	2009	DBLP DOI BibTeX RDF
2	Matthew K. Franklin, Mark Gondree, Payman Mohassel	Communication-Efficient Private Protocols for Longest Common Subsequence.	CT-RSA	2009	DBLP DOI BibTeX RDF
2	Ping Luo, Jian Fan, Sam Liu, Fen Lin, Yuhong Xiong, Jerry Liu	Web article extraction for web printing: a DOM+visual based approach.	ACM Symposium on Document Engineering	2009	DBLP DOI BibTeX RDF	article extraction, maximal scoring subsequence
2	Vinod P. Nair, Vijay Laxmi, Manoj Singh Gaur, G. V. S. S. Phani Kumar, Yadvendra S. Chundawat	Static CFG analyzer for metamorphic Malware code.	SIN	2009	DBLP DOI BibTeX RDF	metamorphic malware, normalization, obfuscation, control flow graph, longest common subsequence
2	Klaus Dräger, Bernd Finkbeiner	Subsequence Invariants.	CONCUR	2008	DBLP DOI BibTeX RDF
2	Funda Ergün, Hossein Jowhari	On distance to monotonicity and longest increasing subsequence of a data stream.	SODA	2008	DBLP DOI BibTeX RDF
2	Mi Zhou, Man Hon Wong	Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance.	ICDE	2008	DBLP DOI BibTeX RDF
2	Dmitry Korkin, Qingguo Wang, Yi Shang	An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem.	ICPP	2008	DBLP DOI BibTeX RDF
2	Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein	On the Longest Common Parameterized Subsequence.	CPM	2008	DBLP DOI BibTeX RDF
2	Lian'en Huang, Lei Wang, Xiaoming Li	Achieving both high precision and high recall in near-duplicate detection.	CIKM	2008	DBLP DOI BibTeX RDF	web document repository, similarity, sketch, fingerprint, longest common subsequence, near-duplicate
2	Bingjun Sun, Prasenjit Mitra, C. Lee Giles	Mining, indexing, and searching for textual chemical molecule information on the web.	WWW	2008	DBLP DOI BibTeX RDF	hierarchical text segmentation, independent frequent subsequence, index pruning, substring search, ranking, similarity search, conditional random fields, entity extraction
2	Alexandre Tiskin	Semi-local String Comparison: Algorithmic Techniques and Applications.	Mathematics in Computer Science	2008	DBLP DOI BibTeX RDF	semi-local string comparison, longest common subsequence, String algorithms
2	Xiaonan Ji, James Bailey, Guozhu Dong	Mining minimal distinguishing subsequence patterns with gap constraints.	Knowl. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Gap constraint, Contrast pattern, Sequential pattern, Frequent pattern, Emerging pattern, Data mining algorithm
2	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
2	Alexander K. Seewald, Florian Kleedorfer	Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering.	Adv. Data Analysis and Classification	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68T05, 93A30, 90C59
2	Longin Jan Latecki, Qiang Wang, Suzan Köknar-Tezel, Vasileios Megalooikonomou	Optimal Subsequence Bijection.	ICDM	2007	DBLP DOI BibTeX RDF
2	Wei Liu, Lin Chen	A Fast Longest Common Subsequence Algorithm for Biosequences Alignment.	CCTA	2007	DBLP DOI BibTeX RDF	identical character pair, bioinformatics, longest common subsequence
2	Sebastian Nowozin, Gökhan H. Bakir, Koji Tsuda	Discriminative Subsequence Mining for Action Classification.	ICCV	2007	DBLP DOI BibTeX RDF
2	Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton	Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.	BIBE	2007	DBLP DOI BibTeX RDF
2	Dariusz Król, Grzegorz Stanislaw Kukla	Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving.	KES-AMSTA	2007	DBLP DOI BibTeX RDF
2	Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen	Algorithms for Computing the Longest Parameterized Common Subsequence.	CPM	2007	DBLP DOI BibTeX RDF
2	David Semé, Sidney Youlou	An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS.	PDCAT	2007	DBLP DOI BibTeX RDF
2	Anna Gál, Parikshit Gopalan	Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.	FOCS	2007	DBLP DOI BibTeX RDF
2	Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner	The Constrained Longest Common Subsequence Problem for Degenerate Strings.	CIAA	2007	DBLP DOI BibTeX RDF
2	Christian Blum, Maria J. Blesa	Probabilistic Beam Search for the Longest Common Subsequence Problem.	SLS	2007	DBLP DOI BibTeX RDF
2	Iman S. H. Suyoto, Alexandra L. Uitdenbogerd, Falk Scholer	Effective retrieval of polyphonic audio with polyphonic symbolic queries.	Multimedia Information Retrieval	2007	DBLP DOI BibTeX RDF	polyphony, dynamic programming, audio, music information retrieval, longest common subsequence, symbolic, transcription
2	Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song	Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications.	ICA3PP	2007	DBLP DOI BibTeX RDF	row-sorted 1-variant matrices, all-substring longest common subsequence, parallel algorithms, data structure, longest common subsequence
2	Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu	RNA multiple structural alignment with longest common subsequences.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	RNA multiple structure alignment, Dynamic programming, Longest common subsequence
2	M. Aziz Muslim, Masumi Ishikawa, Tetsuo Furukawa	Task segmentation in a mobile robot by mnSOM: a new approach to training expert modules.	Neural Computing and Applications	2007	DBLP DOI BibTeX RDF	Task segmentation, Modular network SOM, Mobile robot, Subsequence
2	Francisco Nivando Bezerra, Neucimar Jerônimo Leite	Using string matching to detect video transitions.	Pattern Anal. Appl.	2007	DBLP DOI BibTeX RDF	Video transition detection, Video slice, Longest common subsequence
2	Carlos E. R. Alves, Edson Cáceres, Siang Wun Song	A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.	Algorithmica	2006	DBLP DOI BibTeX RDF
2	Tsuyoshi Idé	Why Does Subsequence Time-Series Clustering Produce Sine Waves?	PKDD	2006	DBLP DOI BibTeX RDF
2	Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich	Window Subsequence Problems for Compressed Texts.	CSR	2006	DBLP DOI BibTeX RDF
2	R. Pradeep Kumar, P. Nagabhushan, Ahlame Douzal Chouakria	WaveSim and Adaptive WaveSim Transform for Subsequence Time-Series Clustering.	ICIT	2006	DBLP DOI BibTeX RDF
2	Seung-Hwan Lim, Heejin Park, Sang-Wook Kim	Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases.	DASFAA	2006	DBLP DOI BibTeX RDF
2	Minghui Jiang	Subsequence Packing: Complexity, Approximation, and Application.	AAIM	2006	DBLP DOI BibTeX RDF
2	Witold Andrzejewski, Tadeusz Morzy	AISS: An Index for Non-timestamped Set Subsequence Queries.	DaWaK	2006	DBLP DOI BibTeX RDF
2	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette	Exemplar Longest Common Subsequence.	International Conference on Computational Science	2006	DBLP DOI BibTeX RDF
2	Yang-Sae Moon, Jin-Ho Kim	A Single Index Approach for Time-Series Subsequence Matching That Supports Moving Average Transform of Arbitrary Order.	PAKDD	2006	DBLP DOI BibTeX RDF
2	Osmar R. Zaïane, Yang Wang, Randy Goebel, Gregory J. Taylor	Frequent Subsequence-Based Protein Localization.	BioDM	2006	DBLP DOI BibTeX RDF
2	Thorsten Bernholt, Thomas Hofmeister	An Algorithm for a Generalized Maximum Subsequence Problem.	LATIN	2006	DBLP DOI BibTeX RDF
2	Byoungchol Chang, Jaehyuk Cha, Sang-Wook Kim, Miyoung Shin	An Index-Based Time-Series Subsequence Matching Under Time Warping.	KES	2006	DBLP DOI BibTeX RDF
2	Tak-Chung Fu, Hak-pun Chan, Fu-Lai Chung, Chak-man Ng	Time Series Subsequence Searching in Specialized Binary Tree.	FSKD	2006	DBLP DOI BibTeX RDF
2	Ming Dong Wan, Shou-Hsuan Stephen Huang, Jianhua Yang	Finding the Longest Similar Subsequence of Thumbprints for Intrusion Detection.	AINA	2006	DBLP DOI BibTeX RDF
2	Tsuyoshi Idé	Translational Symmetry in Subsequence Time-Series Clustering.	JSAI	2006	DBLP DOI BibTeX RDF
2	Sven Rahmann	Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.	CPM	2006	DBLP DOI BibTeX RDF
2	Xiuzhen Huang	Lower Bounds and Parameterized Approach for Longest Common Subsequence.	COCOON	2006	DBLP DOI BibTeX RDF
2	Peter Krusche, Alexandre Tiskin	Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.	ICCSA	2006	DBLP DOI BibTeX RDF
2	M. Sohel Rahman, Costas S. Iliopoulos	Algorithms for Computing Variants of the Longest Common Subsequence Problem.	ISAAC	2006	DBLP DOI BibTeX RDF
2	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
2	Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, Eamonn J. Keogh	Indexing Multidimensional Time-Series.	VLDB J.	2006	DBLP DOI BibTeX RDF	Ensemble index, Motion capture, Trajectories, Dynamic time warping, Longest common subsequence
2	Xiaonan Ji, James Bailey, Guozhu Dong	Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints.	ICDM	2005	DBLP DOI BibTeX RDF
2	Eamonn J. Keogh, Jessica Lin 0001, Ada Wai-Chee Fu	HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence.	ICDM	2005	DBLP DOI BibTeX RDF	Time Series Data Mining, Clustering, Anomaly Detection
2	Jason R. Chen	Making Subsequence Time Series Clustering Meaningful.	ICDM	2005	DBLP DOI BibTeX RDF
2	Huanmei Wu, Betty Salzberg, Gregory C. Sharp, Steve B. Jiang, Hiroki Shirato, David R. Kaeli	Subsequence Matching on Structured Time Series Data.	SIGMOD Conference	2005	DBLP DOI BibTeX RDF