Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Masashi Kiyomi, Takashi Horiyama, Yota Otachi	Longest Common Subsequence in Sublinear Space.	CoRR	2020	DBLP BibTeX RDF
15	Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer	The Edit Distance to k-Subsequence Universality.	CoRR	2020	DBLP BibTeX RDF
15	Taejun Kim, Minsuk Choi, Evan Sacks, Yi-Hsuan Yang, Juhan Nam	A Computational Analysis of Real-World DJ Mixes using Mix-To-Track Subsequence Alignment.	CoRR	2020	DBLP BibTeX RDF
15	Michele Linardi, Themis Palpanas	Scalable Data Series Subsequence Matching with ULISSE.	CoRR	2020	DBLP BibTeX RDF
15	Sachin Pawar, Pushpak Bhattacharyya, Girish K. Palshikar	Extracting N-ary Cross-sentence Relations using Constrained Subsequence Kernel.	CoRR	2020	DBLP BibTeX RDF
15	Ethan Jacob Moyer, Anup Das 0001	Machine learning applications to DNA subsequence and restriction site analysis.	CoRR	2020	DBLP BibTeX RDF
15	Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara	Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.	CoRR	2020	DBLP BibTeX RDF
15	Benjamin Eyre, Aparna Balagopalan, Jekaterina Novikova	Fantastic Features and Where to Find Them: Detecting Cognitive Impairment with a Subsequence Classification Guided Approach.	CoRR	2020	DBLP BibTeX RDF
15	Anadi Agrawal, Pawel Gawrychowski	A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem.	CoRR	2020	DBLP BibTeX RDF
15	Paul Boniol, Themis Palpanas, Mohammed Meftah, Emmanuel Remy	GraphAn: Graph-based Subsequence Anomaly Detection. (PDF / PS)	Proc. VLDB Endow.	2020	DBLP DOI BibTeX RDF
15	Paul Boniol, Themis Palpanas	Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series.	Proc. VLDB Endow.	2020	DBLP BibTeX RDF
15	Abdulrhman Aljouie, Ling Zhong, Usman Roshan	High scoring segment selection for pairwise whole genome sequence alignment with the maximum scoring subsequence and GPUs.	Int. J. Comput. Biol. Drug Des.	2020	DBLP DOI BibTeX RDF
15	Jagannath Bhanja, Ram Krishna Pandey	Inverse problems for certain subsequence sums in integers.	Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Sen-Peng Eu, Tung-Shan Fu, Hsiang-Chun Hsu, Hsin-Chieh Liao, Wei-Liang Sun	Signed mahonian identities on permutations with subsequence restrictions.	J. Comb. Theory, Ser. A	2020	DBLP DOI BibTeX RDF
15	Michele Linardi, Themis Palpanas	Scalable data series subsequence matching with ULISSE.	VLDB J.	2020	DBLP DOI BibTeX RDF
15	Yoshifumi Sakai, Shunsuke Inenaga	A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length.	ISAAC	2020	DBLP DOI BibTeX RDF
15	Anadi Agrawal, Pawel Gawrychowski	A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem.	ISAAC	2020	DBLP DOI BibTeX RDF
15	Anni Jia, Wei Yang, Gongxuan Zhang	Side Channel Leakage Alignment Based on Longest Common Subsequence.	BigDataSE	2020	DBLP DOI BibTeX RDF
15	Aviad Rubinstein, Zhao Song 0002	Reducing approximate Longest Common Subsequence to approximate Edit Distance.	SODA	2020	DBLP DOI BibTeX RDF
15	Paul Boniol, Michele Linardi, Federico Roncallo, Themis Palpanas	SAD: An Unsupervised System for Subsequence Anomaly Detection.	ICDE	2020	DBLP DOI BibTeX RDF
15	Noura Alghamdi, Liang Zhang, Huayi Zhang, Elke A. Rundensteiner, Mohamed Y. Eltabakh	ChainLink: Indexing Big Time Series Data For Long Subsequence Matching.	ICDE	2020	DBLP DOI BibTeX RDF
15	Benjamin Eyre, Aparna Balagopalan, Jekaterina Novikova	Fantastic Features and Where to Find Them: Detecting Cognitive Impairment with a Subsequence Classification Guided Approach.	W-NUT@EMNLP	2020	DBLP DOI BibTeX RDF
15	Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara	Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.	CPM	2020	DBLP DOI BibTeX RDF
15	Evangelos Kipouridis, Kostas Tsichlas	Longest Common Subsequence on Weighted Sequences.	CPM	2020	DBLP DOI BibTeX RDF
15	Yungang Pan, Ke Liu, Zhaoyan Shen, Xiaojun Cai, Zhiping Jia	Sequence-To-Subsequence Learning With Conditional Gan For Power Disaggregation.	ICASSP	2020	DBLP DOI BibTeX RDF
15	Taejun Kim, Minsuk Choi, Evan Sacks, Yi-Hsuan Yang, Juhan Nam	A Computational Analysis of Real-World DJ Mixes using Mix-To-Track Subsequence Alignment.	ISMIR	2020	DBLP BibTeX RDF
15	Wang Xuan, Ziyang Chen, Lusha Zhai	An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence.	NLPIR	2020	DBLP DOI BibTeX RDF
15	Fan Meng	Aiming at real applications: Subsequence Outlier Detection on Mixed-Type Attributes Data in RDBMS.	CIDR	2020	DBLP BibTeX RDF
15	Dilip Singh Sisodia, Inakollu NehaPriyanka, Prodduturi Amulya	Longest Common Subsequence based Multistage Collaborative Filtering for Recommender Systems.	ACIT	2020	DBLP DOI BibTeX RDF
15	Lech Duraj	A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.	STACS	2020	DBLP DOI BibTeX RDF
15	Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum 0001	On Solving a Generalized Constrained Longest Common Subsequence Problem.	OPTIMA	2020	DBLP DOI BibTeX RDF
15	Alexander V. Gnedin, Amirlan Seksenbayev	Diffusion Limits in the Online Subsequence Selection Problems.	AofA	2020	DBLP DOI BibTeX RDF
15	Masaki Ono, Takayuki Katsuki, Masaki Makino, Kyoichi Haida, Atsushi Suzuki	Interpretation Method for Continuous Glucose Monitoring with Subsequence Time-Series Clustering.	MIE	2020	DBLP DOI BibTeX RDF
15	Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai	Longest Square Subsequence Problem Revisited.	SPIRE	2020	DBLP DOI BibTeX RDF
15	Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau	The Longest Run Subsequence Problem.	WABI	2020	DBLP DOI BibTeX RDF
15	Kangzhi Zhao, Yong Zhang 0002, Hongzhi Yin, Jin Wang 0007, Kai Zheng 0001, Xiaofang Zhou 0001, Chunxiao Xing	Discovering Subsequence Patterns for Next POI Recommendation.	IJCAI	2020	DBLP DOI BibTeX RDF
15	Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu	Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.	IPEC	2020	DBLP DOI BibTeX RDF
15	Paul Boniol	Unsupervised Subsequence Anomaly Detection in Large Sequences.	PhD@VLDB	2020	DBLP BibTeX RDF
15	Xueyuan Gong, Simon Fong 0001, Yain-Whar Si	Fast fuzzy subsequence matching algorithms on time-series.	Expert Syst. Appl.	2019	DBLP DOI BibTeX RDF
15	Takuto Sakuma, Kazuya Nishi, Kaoru Kishimoto, Kazuya Nakagawa, Masayuki Karasuyama, Yuta Umezu, Shinsuke Kajioka, Shuhei J. Yamazaki, Koutarou D. Kimura, Sakiko Matsumoto, Ken Yoda, Matasaburo Fukutomi, Hisashi Shidara, Hiroto Ogawa, Ichiro Takeuchi	Efficient learning algorithm for sparse subsequence pattern-based classification and applications to comparative animal trajectory data analysis.	Adv. Robotics	2019	DBLP DOI BibTeX RDF
15	Lech Duraj, Marvin Künnemann, Adam Polak 0001	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.	Algorithmica	2019	DBLP DOI BibTeX RDF
15	Kelin Luo, Yinfeng Xu, Huili Zhang	On-line scheduling with monotone subsequence constraints.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	Yoshifumi Sakai	Maximal common subsequence algorithms.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis	Comparing incomplete sequences via longest common subsequence.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	Jiawei Gao 0001	On the Fine-grained Complexity of Least Weight Subsequence in Graphs.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
15	Antonio Candelieri, Stanislav Fedorov, Vincenzina Messina	Efficient Kernel-based Subsequence Search for User Identification from Walking Activity.	CoRR	2019	DBLP BibTeX RDF
15	Lech Duraj	A sub-quadratic algorithm for the longest common increasing subsequence problem.	CoRR	2019	DBLP BibTeX RDF
15	Chunkai Zhang, Yingyang Chen, Ao Yin	Anomaly Subsequence Detection with Dynamic Local Density for Time Series.	CoRR	2019	DBLP BibTeX RDF
15	Joakim Blikstad	On the longest common subsequence of Thue-Morse words.	CoRR	2019	DBLP BibTeX RDF
15	Aviad Rubinstein, Zhao Song 0002	Reducing approximate Longest Common Subsequence to approximate Edit Distance.	CoRR	2019	DBLP BibTeX RDF
15	Evangelos Kipouridis, Kostas Tsichlas	Longest Common Subsequence on Weighted Sequences.	CoRR	2019	DBLP BibTeX RDF
15	Radu Stefan Mincu, Alexandru Popa 0001	Heuristic algorithms for the Longest Filled Common Subsequence Problem.	CoRR	2019	DBLP BibTeX RDF
15	Md. Rafiqul Islam 0002, C. M. Khaled Saifullah, Zarrin Tasnim Asha, Rezoana Ahamed	Chemical reaction optimization for solving longest common subsequence problem for multiple string.	Soft Comput.	2019	DBLP DOI BibTeX RDF
15	Qin Zhang 0011, Jia Wu 0001, Peng Zhang 0001, Guodong Long, Chengqi Zhang	Salient Subsequence Learning for Time Series Clustering.	IEEE Trans. Pattern Anal. Mach. Intell.	2019	DBLP DOI BibTeX RDF
15	Ronghui Wu, Qing Li, Xiangtao Chen	Mining contrast sequential pattern based on subsequence time distribution variation with discreteness constraints.	Appl. Intell.	2019	DBLP DOI BibTeX RDF
15	Danila Piatov, Sven Helmer, Anton Dignös, Johann Gamper	Interactive and space-efficient multi-dimensional time series subsequence matching.	Inf. Syst.	2019	DBLP DOI BibTeX RDF
15	Antonio Candelieri, Stanislav Fedorov, Enza Messina	Efficient Kernel-Based Subsequence Search for Enabling Health Monitoring Services in IoT-Based Home Setting.	Sensors	2019	DBLP DOI BibTeX RDF
15	Youxi Wu, Yuehua Wang, Jingyu Liu 0003, Ming Yu 0001, Jing Liu, Yan Li 0087	Mining distinguishing subsequence patterns with nonoverlapping condition.	Clust. Comput.	2019	DBLP DOI BibTeX RDF
15	Kaustubh Beedkar, Rainer Gemulla, Wim Martens	A Unified Framework for Frequent Sequence Mining with Subsequence Constraints.	ACM Trans. Database Syst.	2019	DBLP DOI BibTeX RDF
15	Christian Bock, Matteo Togninalli, M. Elisabetta Ghisu, Thomas Gumbsch, Bastian Rieck, Karsten M. Borgwardt	A Wasserstein Subsequence Kernel for Time Series.	ICDM	2019	DBLP DOI BibTeX RDF
15	MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun	Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.	SODA	2019	DBLP DOI BibTeX RDF
15	Alexander Renz-Wieland, Matthias Bertsch, Rainer Gemulla	Scalable Frequent Sequence Mining with Flexible Subsequence Constraints.	ICDE	2019	DBLP DOI BibTeX RDF
15	Jiaye Wu, Peng Wang 0027, Ningting Pan, Chen Wang 0018, Wei Wang 0009, Jianmin Wang 0001	KV-Match: A Subsequence Matching Approach Supporting Normalization and Time Warping.	ICDE	2019	DBLP DOI BibTeX RDF
15	Marko Djukanovic, Günther R. Raidl, Christian Blum 0001	A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.	LOD	2019	DBLP DOI BibTeX RDF
15	Qing Li, Xiangtao Chen, Ronghui Wu	Mining Contrast Sequential Patterns based on Subsequence Location Distribution from Biological Sequences.	DSIT	2019	DBLP DOI BibTeX RDF
15	Chunkai Zhang, Yingyang Chen, Ao Yin	Anomaly Subsequence Detection with Dynamic Local Density for Time Series.	DEXA (2)	2019	DBLP DOI BibTeX RDF
15	Jiafeng Ding, Junhua Fang, Zonglei Zhang, Pengpeng Zhao, Jiajie Xu 0001, Lei Zhao 0001	Real-Time Trajectory Similarity Processing Using Longest Common Subsequence.	HPCC/SmartCity/DSS	2019	DBLP DOI BibTeX RDF
15	Zekun Yin, Hao Zhang, Kai Xu, Yuandong Chan, Shaoliang Peng, Xiaoning Wang, Bertil Schmidt, Weiguo Liu	XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters.	HPCC/SmartCity/DSS	2019	DBLP DOI BibTeX RDF
15	Shoumik Roychoudhury, Fang Zhou, Zoran Obradovic	Leveraging Subsequence-orders for Univariate and Multivariate Time-series Classification.	SDM	2019	DBLP DOI BibTeX RDF
15	Kefeng Feng, Jiaye Wu, Peng Wang 0027, Ningting Pan, Wei Wang 0009	MVS-match: An Efficient Subsequence Matching Approach Based on the Series Synopsis.	DASFAA (3)	2019	DBLP DOI BibTeX RDF
15	Ramoza Ahsan, Muzammil Bashir, Rodica Neamtu, Elke A. Rundensteiner, Gábor N. Sárközy	Nearest Neighbor Subsequence Search in Time Series Data.	IEEE BigData	2019	DBLP DOI BibTeX RDF
15	Marko Djukanovic, Günther R. Raidl, Christian Blum 0001	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem.	EUROCAST (1)	2019	DBLP DOI BibTeX RDF
15	Yuichi Asahiro, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Tadatoshi Utashima	Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.	COCOA	2019	DBLP DOI BibTeX RDF
15	Jiawei Gao 0001	On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs.	IPEC	2019	DBLP DOI BibTeX RDF
15	Michele Linardi	Variable-length similarity search for very large data series: subsequence matching, motif and discord detection. (Recherche de similarité de longueur variable pour l'analyse de grandes séries temporelles: appariement de séquences, recherche de motifs et anomalies).		2019	RDF
15	Paul R. McWhirter, Kashif Kifayat, Qi Shi 0001, Bob Askwith	SQL Injection Attack classification through the feature extraction of SQL query strings using a Gap-Weighted String Subsequence Kernel.	J. Inf. Secur. Appl.	2018	DBLP DOI BibTeX RDF
15	Prodromos Tsinaslanidis	Subsequence dynamic time warping for charting: Bullish and bearish class predictions for NYSE stocks.	Expert Syst. Appl.	2018	DBLP DOI BibTeX RDF
15	Shunsuke Inenaga, Heikki Hyyrö	A hardness result and new algorithm for the longest common palindromic subsequence problem.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
15	Adam Polak 0001	Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence?	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
15	Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi	Efficient geometric-based computation of the string subsequence kernel.	Data Min. Knowl. Discov.	2018	DBLP DOI BibTeX RDF
15	Xueyuan Gong, Simon Fong 0001, Yain-Whar Si	Fast multi-subsequence monitoring on streaming time-series based on Forward-propagation.	Inf. Sci.	2018	DBLP DOI BibTeX RDF
15	Sang Won Bae, Inbok Lee	On finding a longest common palindromic subsequence.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
15	Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang, Shou-Fu Lo	Efficient merged longest common subsequence algorithms for similar sequences.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
15	Feddy Setio Pribadi, Adhistya Erna Permanasari, Teguh Bharata Adji	Short answer scoring system using automatic reference answer generation and geometric average normalized-longest common subsequence (GAN-LCS).	Educ. Inf. Technol.	2018	DBLP DOI BibTeX RDF
15	Youhuan Li, Lei Zou 0001, Huaming Zhang, Dongyan Zhao 0001	Longest Increasing Subsequence Computation over Streaming Sequences.	IEEE Trans. Knowl. Data Eng.	2018	DBLP DOI BibTeX RDF
15	Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen	Non-Overlapping Subsequence Matching of Stream Synopses.	IEEE Trans. Knowl. Data Eng.	2018	DBLP DOI BibTeX RDF
15	Yana Kraeva, Mikhail L. Zymbler	The Use of MPI and OpenMP Technologies for Subsequence Similarity Search in Very Large Time Series on Computer Cluster System with Nodes Based on the Intel Xeon Phi Knights Landing Many-core Processor.	CoRR	2018	DBLP BibTeX RDF
15	Karl Bringmann, Marvin Künnemann	Multivariate Fine-Grained Complexity of Longest Common Subsequence.	CoRR	2018	DBLP BibTeX RDF
15	Barbara Geissmann	Longest Increasing Subsequence under Persistent Comparison Errors.	CoRR	2018	DBLP BibTeX RDF
15	Dev Goyal, Zeeshan Syed, Jenna Wiens	Clinically Meaningful Comparisons Over Time: An Approach to Measuring Patient Similarity based on Subsequence Alignment.	CoRR	2018	DBLP BibTeX RDF
15	Thach Le Nguyen, Severin Gsponer, Iulia Ilie, Georgiana Ifrim	Interpretable Time Series Classification using All-Subsequence Learning and Symbolic Representations in Time and Frequency Domains.	CoRR	2018	DBLP BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa	Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.	Appl. Soft Comput.	2018	DBLP DOI BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa	A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem.	J. Heuristics	2018	DBLP DOI BibTeX RDF
15	Alessandro Arlotto, Yehua Wei, Xinchang Xie	An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample.	Random Struct. Algorithms	2018	DBLP DOI BibTeX RDF
15	Huiqing Wang, Chun Li, Hongwei Sun, Zhirong Guo, Yingying Bai	Shapelet Classification Algorithm Based on Efficient Subsequence Matching.	Data Sci. J.	2018	DBLP DOI BibTeX RDF
15	Zhanbing Wang, Wei Song 0006, Zhiyong Peng, Xiandi Yang, Yihui Cui, Yuan Shen 0005	一种面向密文基因数据的子序列外包查询方法 (Subsequence Outsourcing Query Method over Encrypted Genomic Data).	计算机科学	2018	DBLP DOI BibTeX RDF
15	David J. Grynkiewicz	Iterated sumsets and subsequence sums.	J. Comb. Theory, Ser. A	2018	DBLP DOI BibTeX RDF
15	Alejandro Bellogín, Pablo Sánchez 0001	Applying Subsequence Matching to Collaborative Filtering: Extended Abstract.	CERI	2018	DBLP DOI BibTeX RDF
15	Karl Bringmann, Marvin Künnemann	Multivariate Fine-Grained Complexity of Longest Common Subsequence.	SODA	2018	DBLP DOI BibTeX RDF
15	Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman 0001	On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract).	WALCOM	2018	DBLP DOI BibTeX RDF