Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Zheng Li, Tingjian Ge	Online windowed subsequence matching over probabilistic sequences.	SIGMOD Conference	2012	DBLP DOI BibTeX RDF
15	David Becerra, Juan Mendivelso, Yoan J. Pinzón	A Multiobjective Approach to the Weighted Longest Common Subsequence Problem.	Stringology	2012	DBLP BibTeX RDF
15	Ahmed Amarni, Sylvain Lombardy	Factor and Subsequence Kernels and Signatures of Rational Languages.	CIAA	2012	DBLP DOI BibTeX RDF
15	Majid Sazvar, Mahmoud Naghibzadeh, Nayyereh Saadati	Quick-MLCS: a new algorithm for the multiple longest common subsequence problem.	C3S2E	2012	DBLP DOI BibTeX RDF
15	Youhei Namiki, Takashi Ishida 0002, Yutaka Akiyama	Fast DNA Sequence Clustering Based on Longest Common Subsequence.	ICIC (3)	2012	DBLP DOI BibTeX RDF
15	Silvio Jamil Ferzoli Guimarães, Zenilton Kleber G. do Patrocínio Jr.	A two-step video subsequence identification based on bipartite graph matching.	SMC	2012	DBLP DOI BibTeX RDF
15	Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman	Computing a Longest Common Palindromic Subsequence.	IWOCA	2012	DBLP DOI BibTeX RDF
15	Yonchanok Khaokaew, Sirikarn Pukkawanna	Time series anomaly detection using recessive subsequence.	ICOIN	2012	DBLP DOI BibTeX RDF
15	Meijing Li, Xiuming Yu, Taewook Kim, Keun Ho Ryu	Prediction of protein disordered regions in a protein sequence based on gap-constraint subsequence patterns.	iCAST	2012	DBLP DOI BibTeX RDF
15	Sou-Young Jin, Ho-Jin Choi	Essential Body-Joint and Atomic Action Detection for Human Activity Recognition Using Longest Common Subsequence Algorithm.	ACCV Workshops (2)	2012	DBLP DOI BibTeX RDF
15	Maodi Hu, Yunhong Wang, James J. Little	Combinational Subsequence Matching for Human Identification from General Actions.	ACCV (3)	2012	DBLP DOI BibTeX RDF
15	Witold Andrzejewski, Bartosz Bebel	FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries.	ADBIS	2012	DBLP DOI BibTeX RDF
15	Guillaume Blin, Minghui Jiang 0001, Stéphane Vialette	The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.	SPIRE	2012	DBLP DOI BibTeX RDF
15	Yingni Duan, Haifeng Zhang, Hong Lv, Junchu Fang	Research on the First Class M Subsequence.	CIS	2012	DBLP DOI BibTeX RDF
15	Jiaying Wang, Xiaochun Yang 0001, Bin Wang 0015, Huaijie Zhu	Memory-Aware BWT by Segmenting Sequences to Support Subsequence Search.	APWeb	2012	DBLP DOI BibTeX RDF
15	Abdulla-Al-Maruf, Hung-Hsuan Huang, Kyoji Kawagoe	Time Series Classification Method Based on Longest Common Subsequence and Textual Approximation.	ICDIM	2012	DBLP DOI BibTeX RDF
15	Fabio Cunial	Analysis of the subsequence composition of biosequences.		2012	RDF
15	Silvio Jamil Ferzoli Guimarães, Zenilton Kleber Gonçalves do Patrocínio Jr.	Identification of video subsequence using bipartite graph matching.	J. Braz. Comput. Soc.	2011	DBLP DOI BibTeX RDF
15	Hwei-Jen Lin, Hung-Hsuan Wu, Chun-Wei Wang	Music Matching Based on Rough Longest Common Subsequence.	J. Inf. Sci. Eng.	2011	DBLP BibTeX RDF
15	Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, Takanori Yokoyama	New dissimilarity measure for recognizing noisy subsequence trees.	Int. J. Intell. Syst.	2011	DBLP DOI BibTeX RDF
15	Alessandro Arlotto, J. Michael Steele	Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence.	Comb. Probab. Comput.	2011	DBLP DOI BibTeX RDF
15	Sukumar Das Adhikari, Mohan N. Chintamani	Number of Weighted Subsequence Sums With Weights in {1, -1}.	Integers	2011	DBLP BibTeX RDF
15	Myeong-Seon Gil, Yang-Sae Moon, Bum-Soo Kim	Linear Detrending Subsequence Matching in Time-Series Databases.	IEICE Trans. Inf. Syst.	2011	DBLP DOI BibTeX RDF
15	Yllias Chali, Sadid A. Hasan, Shafiq R. Joty	Improving graph-based random walks for complex question answering using syntactic, shallow semantic and extended string subsequence kernels.	Inf. Process. Manag.	2011	DBLP DOI BibTeX RDF
15	Qingguo Wang, Dmitry Korkin, Yi Shang	A Fast Multiple Longest Common Subsequence (MLCS) Algorithm.	IEEE Trans. Knowl. Data Eng.	2011	DBLP DOI BibTeX RDF
15	Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman	Computing a Longest Common Palindromic Subsequence	CoRR	2011	DBLP BibTeX RDF
15	Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos	A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application.	Proc. VLDB Endow.	2011	DBLP BibTeX RDF
15	Deter de Wet	Subsequence convergence in subdivision.	Math. Comput.	2011	DBLP DOI BibTeX RDF
15	Panagiotis Papapetrou, Vassilis Athitsos, Michalis Potamias, George Kollios, Dimitrios Gunopulos	Embedding-based subsequence matching in time-series databases.	ACM Trans. Database Syst.	2011	DBLP DOI BibTeX RDF
15	Yi-Ching Chen, Kun-Mao Chao	On the generalized constrained longest common subsequence problems.	J. Comb. Optim.	2011	DBLP DOI BibTeX RDF
15	Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann	Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints.	BIBE	2011	DBLP DOI BibTeX RDF
15	Shrikant Kashyap, Mong-Li Lee, Wynne Hsu	Similar Subsequence Search in Time Series Databases.	DEXA (1)	2011	DBLP DOI BibTeX RDF
15	Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda	Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.	CPM	2011	DBLP DOI BibTeX RDF
15	Pramod K. Vemulapalli, Adam J. Dean, Sean N. Brennan	Pitch based vehicle localization using time series subsequence matching with Multi-scale Extrema Features.	ACC	2011	DBLP DOI BibTeX RDF
15	Juan M. Huerta	Subsequence similarity language models.	ICASSP	2011	DBLP DOI BibTeX RDF
15	Toshinori Sakai, Jorge Urrutia	On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets.	EGC	2011	DBLP DOI BibTeX RDF
15	Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Computing Longest Common Substring/Subsequence of Non-linear Texts.	Stringology	2011	DBLP BibTeX RDF
15	Alexander Tiskin	Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition.	CSR	2011	DBLP DOI BibTeX RDF
15	Thanh-Son Nguyen 0002, Tuan-Anh Duong	Time Series Subsequence Matching Based on a Combination of PIP and Clipping.	ACIIDS (1)	2011	DBLP DOI BibTeX RDF
15	Katsuya Kawanami, Noriyuki Fujimoto	GPU Accelerated Computation of the Longest Common Subsequence.	Facing the Multicore-Challenge	2011	DBLP DOI BibTeX RDF
15	Carlos Eduardo Ferreira, Christian Tjandraatmadja	A branch-and-cut approach to the repetition-free longest common subsequence problem.	Electron. Notes Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz	Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
15	Christian Houdré, Ricardo Restrepo	A Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating Subsequence.	Electron. J. Comb.	2010	DBLP DOI BibTeX RDF
15	Amr Elmasry	The longest almost-increasing subsequence.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
15	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola	Variants of constrained longest common subsequence.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz, Joanna Obstój	Constrained Longest Common Subsequence Computing Algorithms in Practice.	Comput. Informatics	2010	DBLP BibTeX RDF
15	Mohamed Elhadi, Amjad Al-Tobi	Detection of Duplication in Documents and WebPages Based Documents Syntactical Structures through an Improved Longest Common Subsequence.	Int. J. Inf. Process. Manag.	2010	DBLP BibTeX RDF
15	Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park	Walk-weighted subsequence kernels for protein-protein interaction extraction.	BMC Bioinform.	2010	DBLP DOI BibTeX RDF
15	Thomas Jansen 0001, Dennis Weyland	Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem.	Algorithmica	2010	DBLP DOI BibTeX RDF
15	Nikhil Bansal 0001, Moshe Lewenstein, Bin Ma 0002, Kaizhong Zhang	On the Longest Common Rigid Subsequence Problem.	Algorithmica	2010	DBLP DOI BibTeX RDF
15	Amit Chakrabarti	A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF
15	Zi Huang, Heng Tao Shen, Jie Shao 0001, Bin Cui 0001, Xiaofang Zhou 0001	Practical Online Near-Duplicate Subsequence Detection for Continuous Video Streams.	IEEE Trans. Multim.	2010	DBLP DOI BibTeX RDF
15	Myeong-Seon Gil, Yang-Sae Moon, Bum-Soo Kim	Linear Detrending Subsequence Matching in Time-Series Databases	CoRR	2010	DBLP BibTeX RDF
15	Kang Ning 0001	Deposition and extension approach to find longest common subsequence for thousands of long sequences.	Comput. Biol. Chem.	2010	DBLP DOI BibTeX RDF
15	Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi	Repetition-free longest common subsequence.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
15	Yang-Sae Moon, Jinho Kim	MBR-safe piecewise aggregate approximation for time-series subsequence matching.	Comput. Syst. Sci. Eng.	2010	DBLP BibTeX RDF
15	Maxime Crochemore, Ely Porat	Fast computation of a longest increasing subsequence and application.	Inf. Comput.	2010	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz	Solving longest common subsequence and related problems on graphical processing units.	Softw. Pract. Exp.	2010	DBLP DOI BibTeX RDF
15	Alberto Apostolico, Fabio Cunial	The Subsequence Composition of Polypeptides.	J. Comput. Biol.	2010	DBLP DOI BibTeX RDF
15	Anna Gál, Parikshit Gopalan	Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
15	Doruk Sart, Abdullah Mueen 0001, Walid A. Najjar, Eamonn J. Keogh, Vit Niennattrakul	Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs.	ICDM	2010	DBLP DOI BibTeX RDF
15	Kanishka Bhaduri, Qiang Zhu 0002, Nikunj C. Oza, Ashok N. Srivastava	Fast and Flexible Multivariate Time Series Subsequence Search.	ICDM	2010	DBLP DOI BibTeX RDF
15	Manuel Lozano 0001, Christian Blum 0001	A Hybrid Metaheuristic for the Longest Common Subsequence Problem.	Hybrid Metaheuristics	2010	DBLP DOI BibTeX RDF
15	Christian Blum 0001	Beam-ACO for the longest common subsequence problem.	IEEE Congress on Evolutionary Computation	2010	DBLP DOI BibTeX RDF
15	Alejandro Flores-Méndez, Manuel Bernal-Urbina	Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms.	IEEE Congress on Evolutionary Computation	2010	DBLP DOI BibTeX RDF
15	Vasile Georgescu	A Computational Intelligence Based Framework for One-Subsequence-Ahead Forecasting of Nonstationary Time Series.	MDAI	2010	DBLP DOI BibTeX RDF
15	Abdullah N. Arslan	A Fast Longest Common Subsequence Algorithm for Similar Strings.	LATA	2010	DBLP DOI BibTeX RDF
15	Bryan M. Franklin, Steven Seidel	A parallel longest common subsequence algorithm in UPC.	SpringSim	2010	DBLP DOI BibTeX RDF
15	Dániel Marx, Ildikó Schlotter	Parameterized Complexity of the Arc-Preserving Subsequence Problem.	WG	2010	DBLP DOI BibTeX RDF
15	Qingguo Wang, Mian Pan, Yi Shang, Dmitry Korkin	A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings.	AAAI	2010	DBLP DOI BibTeX RDF
15	Shuxia Pang, Rui Li, Zhanting Yuan, Qiuyu Zhang	Subsequence kernel-based Chinese recommender system.	ICNC	2010	DBLP DOI BibTeX RDF
15	Jiangde Yu, Chuan Gu, Wenying Ge	Combining Character-Based and Subsequence-Based Tagging for Chinese Word Segmentation.	CIPS-SIGHAN	2010	DBLP BibTeX RDF
15	Takuma Nishii, Tomoyuki Hiroyasu, Masato Yoshimi, Mitsunori Miki, Hisatake Yokouchi	Similar subsequence retrieval from two time series data using homology search.	SMC	2010	DBLP DOI BibTeX RDF
15	Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman	Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.	SPIRE	2010	DBLP DOI BibTeX RDF
15	Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen	Subsequence Matching of Stream Synopses under the Time Warping Distance.	PAKDD (2)	2010	DBLP DOI BibTeX RDF
15	Mohamed Elhadi, Amjad Al-Tobi	Refinements of Longest Common Subsequence algorithm.	AICCSA	2010	DBLP DOI BibTeX RDF
15	Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub	Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem.	AICCSA	2010	DBLP DOI BibTeX RDF
15	Philip Bille, Inge Li Gørtz	Fast Arc-Annotated Subsequence Matching in Linear Space.	SOFSEM	2010	DBLP DOI BibTeX RDF
15	Amr Elmasry	The Longest Almost-Increasing Subsequence.	COCOON	2010	DBLP DOI BibTeX RDF
15	Nikhil S. Ketkar, G. Michael Youngblood	A Largest Common Subsequence-based Distance Measure for Classifying Player Motion Traces in Virtual Worlds.	FLAIRS	2010	DBLP BibTeX RDF
15	Klaus Dräger	Subsequence invariants.		2010	RDF
15	Jason Chen	Subsequence Time Series Clustering.	Encyclopedia of Data Warehousing and Mining	2009	DBLP BibTeX RDF
15	Pingzhi Yuan	Subsequence Sums of Zero-sum-free Sequences.	Electron. J. Comb.	2009	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz	An algorithm for solving the longest increasing circular subsequence problem.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz, Szymon Grabowski	A hybrid algorithm for the longest common transposition-invariant subsequence problem.	Comput. Informatics	2009	DBLP BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa, Manuel López-Ibáñez 0001	Beam search for the longest common subsequence problem.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
15	Shyong Jian Shyu, Chun-Yuan Tsai	Finding the longest common subsequence for multiple biological sequences by ant colony optimization.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
15	Pingzhi Yuan	Subsequence sums of a zero-sumfree sequence.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
15	Alberto Apostolico, Fabio Cunial	The subsequence composition of a string.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein	On the longest common parameterized subsequence.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Yoshifumi Sakai	Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Kang Ning 0001	A Deposition and Post Processing Approach for the Longest Common Subsequence Problem	CoRR	2009	DBLP BibTeX RDF
15	Majid Fozunbal	A Subsequence-Histogram Method for Generic Vocabulary Recognition over Deletion Channels	CoRR	2009	DBLP BibTeX RDF
15	Philip Bille, Inge Li Gørtz	Fast Arc-Annotated Subsequence Matching in Linear Space	CoRR	2009	DBLP BibTeX RDF
15		An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence	CoRR	2009	DBLP BibTeX RDF
15	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola	Variants of Constrained Longest Common Subsequence	CoRR	2009	DBLP BibTeX RDF
15	Yang-Sae Moon, Woong-Kee Loh	Efficient stream subsequence matching algorithms for handheld devices on streaming time-series data.	Comput. Syst. Sci. Eng.	2009	DBLP BibTeX RDF
15	Yang-Sae Moon, Woong-Kee Loh	Efficient stream subsequence matching algorithms for handheld devices on streaming time-series data.	Comput. Syst. Sci. Eng.	2009	DBLP BibTeX RDF
15	Matthew K. Franklin, Mark A. Gondree, Payman Mohassel	Communication-Efficient Private Protocols for Longest Common Subsequence.	IACR Cryptol. ePrint Arch.	2009	DBLP BibTeX RDF
15	Mark A. Gondree, Payman Mohassel	Longest Common Subsequence as Private Search.	IACR Cryptol. ePrint Arch.	2009	DBLP BibTeX RDF