Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Yoshifumi Sakai	Maximal Common Subsequence Algorithms.	CPM	2018	DBLP DOI BibTeX RDF
15	Glenn Paul P. Gara, Mark Phil B. Pacot, Roger Luis Uy	RISC-Based Simulation of Longest Common Subsequence Algorithm in MIPS64 Simulators.	TENCON	2018	DBLP DOI BibTeX RDF
15	Marko Djukanovic, Günther R. Raidl, Christian Blum 0001	Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem.	LION	2018	DBLP DOI BibTeX RDF
15	Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin	Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.	LION	2018	DBLP DOI BibTeX RDF
15	Tao Qiu, Xiaochun Yang 0001, Bin Wang 0015, Yutong Han, Siyao Wang	Efficient Approximate Subsequence Matching Using Hybrid Signatures.	DASFAA (1)	2018	DBLP DOI BibTeX RDF
15	Masashi Kiyomi, Hirotaka Ono 0001, Yota Otachi, Pascal Schweitzer, Jun Tarui	Space-Efficient Algorithms for Longest Increasing Subsequence.	STACS	2018	DBLP DOI BibTeX RDF
15	Barbara Geissmann	Longest Increasing Subsequence Under Persistent Comparison Errors.	WAOA	2018	DBLP DOI BibTeX RDF
15	Shu Zhang 0005, Ruizhi Wang, Daming Zhu, Haitao Jiang, Haodi Feng, Jiong Guo, Xiaowen Liu	The Longest Common Exemplar Subsequence Problem.	BIBM	2018	DBLP DOI BibTeX RDF
15	Semih Yavuz, Chung-Cheng Chiu, Patrick Nguyen, Yonghui Wu	CaLcs: Continuously Approximating Longest Common Subsequence for Sequence Level Optimization.	EMNLP	2018	DBLP DOI BibTeX RDF
15	Honghui Dong, Jie Man, Limin Jia 0002, Xuzhao Wang, Yong Qin 0002, Kai Liu	Traffic Speed Estimation Using Mobile Phone Location Data Based on Longest Common Subsequence.	ITSC	2018	DBLP DOI BibTeX RDF
15	Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji	Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint.	HPCS	2018	DBLP DOI BibTeX RDF
15	Radu Stefan Mincu, Alexandru Popa 0001	Heuristic Algorithms for the Longest Filled Common Subsequence Problem.	SYNASC	2018	DBLP DOI BibTeX RDF
15	Yana Kraeva, Mikhail L. Zymbler	An Efficient Subsequence Similarity Search on Modern Intel Many-core Processors for Data Intensive Applications.	DAMDID/RCDL	2018	DBLP BibTeX RDF
15	Yana Kraeva, Mikhail L. Zymbler	Scalable Algorithm for Subsequence Similarity Search in Very Large Time Series Data on Cluster of Phi KNL.	DAMDID/RCDL (Selected Papers)	2018	DBLP DOI BibTeX RDF
15	Siang-Huai Hung, Chang-Biau Yang, Kuo-Si Huang	A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.	ICS	2018	DBLP DOI BibTeX RDF
15	Abdullah M. Albarrak, Sanad Al-Maskari, Ibrahim A. Ibrahim, Abdulqader M. Almars	Efficiently Mining Constrained Subsequence Patterns.	ADMA	2018	DBLP DOI BibTeX RDF
15	Wooyoung Kwon, Sang Hyoung Lee, Il Hong Suh	Motion codeword generation using selective subsequence clustering for human action recognition.	Intell. Serv. Robotics	2017	DBLP DOI BibTeX RDF
15	Xingzhe Xie, Wenzhi Liao, Hamid K. Aghajan, Peter Veelaert, Wilfried Philips	Detecting Road Intersections from GPS Traces Using Longest Common Subsequence Algorithm.	ISPRS Int. J. Geo Inf.	2017	DBLP DOI BibTeX RDF
15	Alejandro Bellogín, Pablo Sánchez 0001	Collaborative filtering based on subsequence matching: A new approach.	Inf. Sci.	2017	DBLP DOI BibTeX RDF
15	Min Yuan, Heng Yao, Chuan Qin 0001, Ying Tian	A Dynamic Hand Gesture Recognition System Incorporating Orientation-based Linear Extrapolation Predictor and Velocity-assisted Longest Common Subsequence Algorithm.	KSII Trans. Internet Inf. Syst.	2017	DBLP DOI BibTeX RDF
15	Philip Bille, Patrick Hagge Cording, Inge Li Gørtz	Compressed Subsequence Matching and Packed Tree Coloring.	Algorithmica	2017	DBLP DOI BibTeX RDF
15	Daxin Zhu, Lei Wang 0010, Tinran Wang, Xiaodong Wang 0003	A space efficient algorithm for the longest common subsequence in k-length substrings.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
15	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Subsequence automata with default transitions.	J. Discrete Algorithms	2017	DBLP DOI BibTeX RDF
15	Jiaye Wu, Peng Wang 0027, Chen Wang 0018, Wei Wang 0009, Jianmin Wang 0001	KV-match: An Efficient Subsequence Matching Approach for Large Scale Time Series.	CoRR	2017	DBLP BibTeX RDF
15	Adam Polak 0001	Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence?	CoRR	2017	DBLP BibTeX RDF
15	Lech Duraj, Marvin Künnemann, Adam Polak 0001	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.	CoRR	2017	DBLP BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa	A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem.	CoRR	2017	DBLP BibTeX RDF
15	Masashi Kiyomi, Hirotaka Ono 0001, Yota Otachi, Pascal Schweitzer, Jun Tarui	Space-Efficient Algorithms for Longest Increasing Subsequence.	CoRR	2017	DBLP BibTeX RDF
15	Severin Gsponer, Barry Smyth, Georgiana Ifrim	Efficient Sequence Regression by Learning Linear Models in All-Subsequence Space.	ECML/PKDD (2)	2017	DBLP DOI BibTeX RDF
15	Weihao Cheng 0001, Sarah M. Erfani, Rui Zhang 0003, Kotagiri Ramamohanarao	Markov Dynamic Subsequence Ensemble for Energy-Efficient Activity Recognition.	MobiQuitous	2017	DBLP DOI BibTeX RDF
15	Cheng-Wei Yang, Bijay Prasad Jaysawal, Jen-Wei Huang	Subsequence Search Considering Duration and Relations of Events in Time Interval-Based Events Sequences.	DSAA	2017	DBLP DOI BibTeX RDF
15	Thach Le Nguyen, Severin Gsponer, Georgiana Ifrim	Time Series Classification by Sequence Learning in All-Subsequence Space.	ICDE	2017	DBLP DOI BibTeX RDF
15	Kyounghyun Park, Hee Sun Won, Keun Ho Ryu	A Study on Subsequence Similarity Join in Time Series Data Using MapReduce.	CSA/CUTE	2017	DBLP DOI BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa	A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem.	CEC	2017	DBLP DOI BibTeX RDF
15	Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis	The Longest Filled Common Subsequence Problem.	CPM	2017	DBLP DOI BibTeX RDF
15	Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo	On-line Scheduling with a Monotonous Subsequence Constraint.	FAW	2017	DBLP DOI BibTeX RDF
15	Haixin Wang 0004, Dawit Aberra	Similarity evaluation on noisy time series gene expression data using particle filter and longest common subsequence.	ICNC-FSKD	2017	DBLP DOI BibTeX RDF
15	Jan Sedmidubský, Pavel Zezula	A Web Application for Subsequence Matching in 3D Human Motion Data.	ISM	2017	DBLP DOI BibTeX RDF
15	Danila Piatov, Sven Helmer, Johann Gamper	Interactive Time Series Subsequence Matching.	ADBIS	2017	DBLP DOI BibTeX RDF
15	Jan Sedmidubský, Pavel Zezula, Jan Svec	Fast Subsequence Matching in Motion Capture Data.	ADBIS	2017	DBLP DOI BibTeX RDF
15	Mariem Taktak, Slim Triki, Anas Kamoun	SAX-Based Representation with Longest Common Subsequence Dissimilarity Measure for Time Series Data Classification.	AICCSA	2017	DBLP DOI BibTeX RDF
15	Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara	Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.	SOFSEM	2017	DBLP DOI BibTeX RDF
15	Chunkai Zhang, Haodong Liu, Ao Yin	Research of Detection Algorithm for Time Series Abnormal Subsequence.	ICPCSEE (1)	2017	DBLP DOI BibTeX RDF
15	Yuhong Li, Bo Tang 0016, Leong Hou U, Man Lung Yiu, Zhiguo Gong	Fast Subsequence Search on Time Series Data.	EDBT	2017	DBLP DOI BibTeX RDF
15	Lech Duraj, Marvin Künnemann, Adam Polak 0001	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.	IPEC	2017	DBLP DOI BibTeX RDF
15	Anderson C. Lima, Rodrigo G. Branco, Samuel Ferraz, Edson Norberto Cáceres, Roussian R. A. Gaioso, Wellington Santos Martins, Siang W. Song	Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA.	J. Braz. Comput. Soc.	2016	DBLP DOI BibTeX RDF
15	Jun-Feng Qu, Lei Yuan, Yannong Huang, Zhao Wu	An efficient algorithm for attribute-based subsequence matching.	Inf. Sci.	2016	DBLP DOI BibTeX RDF
15	Xueyuan Gong, Simon Fong 0001, Jonathan H. Chan, Sabah Mohammed	NSPRING: the SPRING extension for subsequence matching of time series supporting normalization.	J. Supercomput.	2016	DBLP DOI BibTeX RDF
15	Raj Kumar Mistri, Ram Krishna Pandey	The Direct and Inverse Theorems on Integer Subsequence Sums Revisited.	Integers	2016	DBLP BibTeX RDF
15	Kai-Wen Cheng, Yie-Tarng Chen, Wen-Hsien Fang	An efficient subsequence search for video anomaly detection and localization.	Multim. Tools Appl.	2016	DBLP DOI BibTeX RDF
15	Philipp H. Boersch-Supan	rucrdtw: Fast time series subsequence search in R.	J. Open Source Softw.	2016	DBLP DOI BibTeX RDF
15	Paolo Arena, Marco Calí, Luca Patané, Agnese Portera, Roland Strauss	A Fly-Inspired Mushroom Bodies Model for Sensory-Motor Control Through Sequence and Subsequence Learning.	Int. J. Neural Syst.	2016	DBLP DOI BibTeX RDF
15	Jaroslav M. Fowkes, Charles Sutton	A Subsequence Interleaving Model for Sequential Pattern Mining.	CoRR	2016	DBLP BibTeX RDF
15	Shunsuke Inenaga, Heikki Hyyrö	A hardness result and new algorithm for the longest common palindromic subsequence problem.	CoRR	2016	DBLP BibTeX RDF
15	Daxin Zhu, Lei Wang 0010, Tinran Wang, Xiaodong Wang 0003	A simple linear space algorithm for computing a longest common increasing subsequence.	CoRR	2016	DBLP BibTeX RDF
15	Jarek Duda 0001	Distortion-Resistant Hashing for rapid search of similar DNA subsequence.	CoRR	2016	DBLP BibTeX RDF
15	Kaustubh Beedkar, Rainer Gemulla	DESQ: Frequent Sequence Mining with Subsequence Constraints.	CoRR	2016	DBLP BibTeX RDF
15	Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara	Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.	CoRR	2016	DBLP BibTeX RDF
15	Youhuan Li, Lei Zou 0001, Huaming Zhang, Dongyan Zhao 0001	Computing Longest Increasing Subsequence Over Sequential Data Streams.	CoRR	2016	DBLP BibTeX RDF
15	Cristina G. Fernandes, Marcos A. Kiwi	Repetition-free longest common subsequence of random sequences.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
15	Luca Bonomi, Li Xiong 0001	On Differentially Private Longest Increasing Subsequence Computation in Data Stream.	Trans. Data Priv.	2016	DBLP BibTeX RDF
15	Alessandro Arlotto, Elchanan Mossel, J. Michael Steele	Quickest online selection of an increasing subsequence of specified size.	Random Struct. Algorithms	2016	DBLP DOI BibTeX RDF
15	Kaustubh Beedkar, Rainer Gemulla	DESQ: Frequent Sequence Mining with Subsequence Constraints.	ICDM	2016	DBLP DOI BibTeX RDF
15	Luong Van Do, Duong Tuan Anh	Some improvements for time series subsequence join based on pearson correlation coefficients.	SoICT	2016	DBLP DOI BibTeX RDF
15	Jongik Kim, Chen Li 0001, Xiaohui Xie	Hobbes3: Dynamic generation of variable-length signatures for efficient approximate subsequence mappings.	ICDE	2016	DBLP DOI BibTeX RDF
15	Vo Duc Vinh, Nguyen Phuc Chau, Duong Tuan Anh	An Efficient Method for Time Series Join on Subsequence Correlation Using Longest Common Substring Algorithm.	ICCASA	2016	DBLP DOI BibTeX RDF
15	Colin Raffel, Daniel P. W. Ellis	Pruning subsequence search with attention-based embedding.	ICASSP	2016	DBLP DOI BibTeX RDF
15	Jaroslav M. Fowkes, Charles Sutton	A Subsequence Interleaving Model for Sequential Pattern Mining.	KDD	2016	DBLP DOI BibTeX RDF
15	Kristopher David Harjono, Gede Putra Kusuma	Object instance recognition using best increasing subsequence.	KICSS	2016	DBLP DOI BibTeX RDF
15	Petra Surynková, Pavel Surynek	Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals.	MMCS	2016	DBLP DOI BibTeX RDF
15	Xiaodong Wang 0003, Yingjie Wu, Daxin Zhu	A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem.	GPC	2016	DBLP DOI BibTeX RDF
15	Alexander Kelmanov, Sergey A. Khamidullin, Semyon Romanchenko	Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence.	DOOR (Supplement)	2016	DBLP BibTeX RDF
15	Richen Liu, Hanqi Guo 0001, Jiang Zhang 0002, Xiaoru Yuan	Comparative visualization of vector field ensembles based on longest common subsequence.	PacificVis	2016	DBLP DOI BibTeX RDF
15	Nitchan Jianwattanapaisarn, Nirattaya Khamsemanan, Cholwich Nattee	Gait Recognition from Freestyle Walks Using Relative Coordinates and Random Subsequence-Based Sum-Rule Classification.	SCIS&ISIS	2016	DBLP DOI BibTeX RDF
15	Shouyi Wang, KinMing Kam, Cao Xiao, Stephen R. Bowen, Wanpracha Art Chaovalitwongse	An Efficient Time Series Subsequence Pattern Mining and Prediction Framework with an Application to Respiratory Motion Prediction.	AAAI	2016	DBLP DOI BibTeX RDF
15	Kelin Luo, Yin-Feng Xu, Xin Feng 0001	Online Scheduling with Increasing Subsequence Serving Constraint.	FAW	2016	DBLP DOI BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa	Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.	EvoCOP	2016	DBLP DOI BibTeX RDF
15	Alexey Sorokin	Using longest common subsequence and character models to predict word forms.	SIGMORPHON	2016	DBLP BibTeX RDF
15	Octavian Lucian Hasna, Rodica Potolea	The Longest Common Subsequence Distance using a Complexity Factor.	KDIR	2016	DBLP DOI BibTeX RDF
15	Yixuan Ma, Zhenji Zhang	Subsequence pattern discovery in Chinese university financial data.	LISS	2016	DBLP DOI BibTeX RDF
15	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Subsequence Automata with Default Transitions.	SOFSEM	2016	DBLP DOI BibTeX RDF
15	Rusen Halepmollasi, Ismail Bilgen, Ömer Sinan Saraç	Subsequence profile map for protein fold recognition.	SIU	2016	DBLP DOI BibTeX RDF
15	Zhiwei Tao, Li Zhang 0004, Bangjun Wang, Fanzhang Li	Time Series Classification Based on Multi-codebook Important Time Subsequence Approximation Algorithm.	ICONIP (4)	2016	DBLP DOI BibTeX RDF
15	Kaustubh Beedkar	Methods for Frequent Sequence Mining with Subsequence Constraints.		2016	RDF
15	Igor Pak, Robin Pemantle	On the Longest $k$-Alternating Subsequence.	Electron. J. Comb.	2015	DBLP DOI BibTeX RDF
15	Melkamu Zeleke, Mahendra Jani	On Subsets of Ordered Trees Enumerated by a Subsequence of Fibonacci Numbers.	Integers	2015	DBLP BibTeX RDF
15	Ibrahim Özkan, I. Burhan Türksen	Fuzzy Longest Common Subsequence Matching With FCM.	CoRR	2015	DBLP BibTeX RDF
15	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Subsequence Automata with Default Transitions.	CoRR	2015	DBLP BibTeX RDF
15	Daxin Zhu, Lei Wang 0010, Yingjie Wu, Xiaodong Wang 0003	A Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence.	CoRR	2015	DBLP BibTeX RDF
15	Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi	Efficient Geometric-based Computation of the String Subsequence Kernel.	CoRR	2015	DBLP BibTeX RDF
15	Jesús González-Rubio, Francisco Casacuberta	Minimum Bayes' risk subsequence combination for machine translation.	Pattern Anal. Appl.	2015	DBLP DOI BibTeX RDF
15	Liying Fang, Min Wan, Mingwei Yu, Jianzhuo Yan, Zheng Liu, Pu Wang	Analysis of similarity measure in the longitudinal study using improved longest common subsequence method for lung cancer.	Biomed. Signal Process. Control.	2015	DBLP DOI BibTeX RDF
15	Jens Barth, Cäcilia Oberndorfer, Cristian F. Pasluosta, Samuel Schülein, Heiko Gassner, Samuel J. Reinfelder, Patrick Kugler, Dominik Schuldhaus, Jürgen Winkler, Jochen Klucken, Björn M. Eskofier	Stride Segmentation during Free Walk Movements Using Multi-Dimensional Subsequence Dynamic Time Warping on Inertial Sensor Data.	Sensors	2015	DBLP DOI BibTeX RDF
15	Clementine Nyirarugira, TaeYong Kim 0003	Stratified gesture recognition using the normalized longest common subsequence with rough sets.	Signal Process. Image Commun.	2015	DBLP DOI BibTeX RDF
15	Tommy Wuxing Cai	Average length of the longest k-alternating subsequence.	J. Comb. Theory, Ser. A	2015	DBLP DOI BibTeX RDF
15	Alexios Kotsifakos, Isak Karlsson, Panagiotis Papapetrou, Vassilis Athitsos, Dimitrios Gunopulos	Embedding-based subsequence matching with gaps-range-tolerances: a Query-By-Humming application.	VLDB J.	2015	DBLP DOI BibTeX RDF
15	Chunyao Song, Tingjian Ge	Window-chained longest common subsequence: Common event matching in sequences.	ICDE	2015	DBLP DOI BibTeX RDF
15	Daxin Zhu, Yingjie Wu, Xiaodong Wang 0003	A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints.	IOV	2015	DBLP DOI BibTeX RDF
15	Ruslan Miniakhmetov, Aleksander Movchan, Mikhail L. Zymbler	Accelerating time series subsequence matching on the Intel Xeon Phi many-core coprocessor.	MIPRO	2015	DBLP DOI BibTeX RDF
15	Anderson C. Lima, Rodrigo G. Branco, Edson Norberto Cáceres, Roussian R. A. Gaioso, Samuel Ferraz, Siang Wun Song, Wellington Santos Martins	Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems1.	ICCS	2015	DBLP DOI BibTeX RDF