The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for subsequence with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1961-1985 (16) 1986-1990 (17) 1991-1994 (19) 1995-1997 (20) 1998 (17) 1999 (15) 2000 (21) 2001 (24) 2002 (31) 2003 (39) 2004 (57) 2005 (77) 2006 (84) 2007 (89) 2008 (72) 2009 (71) 2010 (44) 2011 (24) 2012 (44) 2013 (38) 2014 (27) 2015 (24) 2016 (40) 2017 (30) 2018 (41) 2019 (38) 2020 (58) 2021 (47) 2022 (40) 2023 (62) 2024 (6)
Publication types (Num. hits)
article(512) incollection(3) inproceedings(711) phdthesis(6)
Venues (Conferences, Journals, ...)
CoRR(102) CPM(34) Inf. Process. Lett.(32) Theor. Comput. Sci.(22) ICDE(21) SPIRE(18) ICDM(17) SODA(15) Algorithmica(14) ISAAC(14) IEEE Trans. Knowl. Data Eng.(13) SIGMOD Conference(12) Electron. J. Comb.(9) VLDB J.(9) BIBE(8) J. ACM(8) More (+10 of total 550)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 488 occurrences of 321 keywords

Results
Found 1232 publication records. Showing 1232 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
19Congnan Luo, Soon Myoung Chung A Scalable Algorithm for Mining Maximal Frequent Sequences Using Sampling. Search on Bibsonomy ICTAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Kjell Lemström, Gonzalo Navarro 0001, Yoan J. Pinzón Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS. Search on Bibsonomy SPIRE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19George S. Lueker Improved bounds on the average length of longest common subsequences. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
19Wolfgang Merkle, Jan Reimann 0001 On Selection Functions that Do Not Preserve Normality. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Jian Pei, Jiawei Han 0001, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal, Meichun Hsu PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. Search on Bibsonomy ICDE The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa A Practical Algorithm to Find the Best Episode Patterns. Search on Bibsonomy Discovery Science The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée Hidden Pattern Statistics. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Ruifeng Guo, Irith Pomeranz, Sudhakar M. Reddy On Improving Static Test Compaction for Sequential Circuits. Search on Bibsonomy VLSI Design The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Lajos Rónyai On a Conjecture of Kemnitz. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 11B50, 11P21
19Irith Pomeranz, Sudhakar M. Reddy Static Test Compaction for Scan-Based Designs to Reduce Test Application Time. Search on Bibsonomy J. Electron. Test. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF scan circuits, test application time, static test compaction
19Edward Kim, Joyce M. W. Lam, Jiawei Han 0001 AIM: Approximate Intelligent Matching for Time Series Data. Search on Bibsonomy DaWaK The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
19Patricia A. Evans Finding Common Subsequences with Arcs and Pseudoknots. Search on Bibsonomy CPM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
19Irith Pomeranz, Sudhakar M. Reddy Static Test Compaction for Scan-Based Designs to Reduce Test Application Time. Search on Bibsonomy Asian Test Symposium The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
19Ruifeng Guo, Irith Pomeranz, Sudhakar M. Reddy On Speeding-Up Vector Restoration Based Static Compaction of Test Sequences for Sequential Circuits . Search on Bibsonomy Asian Test Symposium The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
19Zdenek Tronícek Operations on DASG. Search on Bibsonomy Workshop on Implementing Automata The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
16Stephen A. Fenner, William I. Gasarch, Brian Postow The Complexity of Finding SUBSEQ(A). Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Turing degree, Higman’s lemma, Unbounded search, Recursive mathematics, Computational complexity, Computability, Context-free grammar, Automata theory, Automaton, Context-free language, Subsequence, Reverse mathematics, Bounded queries
16Bing Yang 0001, Jing Chen 0020, Enyue Lu, Si-Qing Zheng Design and Performance Evaluation of Sequence Partition Algorithms. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF monotone subsequence, permutation algorithm, complexity, approximation, NP-complete
16Ada Wai-Chee Fu, Eamonn J. Keogh, Leo Yung Hang Lau, Chotirat (Ann) Ratanamahatana, Raymond Chi-Wing Wong Scaling and time warping in time series querying. Search on Bibsonomy VLDB J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Scaled and warped matching, Uniform scaling, Dynamic time warping, Nearest neighbor search, Subsequence matching
16Guoliang Li 0001, Jianhua Feng, Jianyong Wang 0001, Feng Lin, Lizhu Zhou Efficient vectorial operators for processing xml twig queries. Search on Bibsonomy WWW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF vectorial operators, subsequence match, holistic twig join
16Mourad Elloumi, Ahmed Mokaddem An Algorithm for Multiple and Global Alignments. Search on Bibsonomy BIRD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multiple and global alignments, common subsequence, algorithms, complexities, Strings, divide-and-conquer strategy
16Bing Yang 0001, Jing Chen 0020, Enyue Lu, S. Q. Zheng 0001 A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF algorithm, complexity, approximation, NP-complete, permutation, monotone, subsequence
16Eamonn J. Keogh, Jessica Lin 0001 Clustering of time-series subsequences is meaningless: implications for previous and future research. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Data mining, Clustering, Time series, Rule discovery, Subsequence
16Nadav Efraty, Gad M. Landau Sparse Normalized Local Alignment. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Largest Common Subsequence (LCS), Algorithms, Dynamic programming, String matching, Local alignment
16Tamer Kahveci, Ambuj K. Singh Optimizing Similarity Search for Arbitrary Length Time Series Queries. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF subsequence search, Time series, range query, nearest neighbor query, multiple resolutions
16Sung Eun Bae, Tadao Takaoka Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. Search on Bibsonomy ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF maximum subarray, maximum subsequence, VLSI, prefix sums
16Mikhail J. Atallah, Florian Kerschbaum, Wenliang Du Secure and private sequence comparisons. Search on Bibsonomy WPES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF privacy, dynamic programming, string matching, edit distance, secure multi-party computation, longest common subsequence
16Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Hong Lee, Chin-Wan Chung Similarity Search for Multidimensional Data Sequences. Search on Bibsonomy ICDE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF multidimensional data sequence, subsequence finding, similarity search, multimedia retrieval, video search
16Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. Patel Fast Static Compaction Algorithms for Sequential Circuit Test Vectors. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Static test set compaction, recurrence subsequence, test generation, fault simulation
15Francesco Spinnato, Riccardo Guidotti, Anna Monreale, Mirco Nanni, Dino Pedreschi, Fosca Giannotti Understanding Any Time Series Classifier with a Subsequence-based Explainer. Search on Bibsonomy ACM Trans. Knowl. Discov. Data The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Michael Franklin Mbouopda, Engelbert Mephu Nguifo Scalable and accurate subsequence transform for time series classification. Search on Bibsonomy Pattern Recognit. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga Computing Longest Common Subsequence under Cartesian-Tree Matching Model. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Complexity Retracted: Matching Subsequence Music Retrieval in a Software Integration Environment. Search on Bibsonomy Complex. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Jaume Reixach, Christian Blum 0001, Marko Djukanovic, Günther R. Raidl A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. Search on Bibsonomy EvoStar The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Lei Gong, Hang Zhang, Zongyou Liu, Kai Ming Ting, Yang Cao, Ye Zhu 0002 Local Subsequence-Based Distribution for Time Series Clustering. Search on Bibsonomy PAKDD (1) The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Thi Phuong Quyen Nguyen, Phan Nguyen Ky Phuc, Chao-Lung Yang, Hendri Sutrisno, Bao-Han Luong, Thi Huynh Anh Le, Thanh Tung Nguyen Time-series anomaly detection using dynamic programming based longest common subsequence on sensor data. Search on Bibsonomy Expert Syst. Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Jonas Köhne, Lars Henning, Clemens Gühmann Autoencoder-Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm. Search on Bibsonomy IEEE Access The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Jing Lu, Jingli Deng, Zhou Ren, Yu Shi Flight Training Subject Identification Method Based on Multivariate Subsequence Search With Double Windows. Search on Bibsonomy IEEE Access The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Chang Dong, Jianfeng Tao, Qun Chao, Honggan Yu, Chengliang Liu 0001 Subsequence Time Series Clustering-Based Unsupervised Approach for Anomaly Detection of Axial Piston Pumps. Search on Bibsonomy IEEE Trans. Instrum. Meas. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Karl Bringmann, Vincent Cohen-Addad, Debarati Das 0001 A Linear-Time n0.4-Approximation for Longest Common Subsequence. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Sudakshina Mandal, Danish Ali Khan Enhanced-Longest Common Subsequence based novel steganography approach for cloud storage. Search on Bibsonomy Multim. Tools Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Miyuji Hirota, Yoshifumi Sakai A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. Search on Bibsonomy IEICE Trans. Fundam. Electron. Commun. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Chunlei Li 0009 Study on typical process route mining method based on multilevel longest common subsequence information entropy and intelligent clustering model. Search on Bibsonomy Int. J. Comput. Integr. Manuf. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Bi-Shiang Lin, Kuo-Si Huang, Chang-Biau Yang Linear-space S-table algorithms for the longest common subsequence problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Xiang Li, Qian Shi, Ke Chen, Mingfu Shao Seeding with minimized subsequence. Search on Bibsonomy Bioinform. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Shiwei Wei, Yuping Wang 0003, Yiu-ming Cheung A Branch Elimination-Based Efficient Algorithm for Large-Scale Multiple Longest Common Subsequence Problem. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Georgios Chatzigeorgakidis, Dimitrios Skoutas 0001, Kostas Patroumpas, Themis Palpanas, Spiros Athanasiou, Spiros Skiadopoulos Efficient Range and kNN Twin Subsequence Search in Time Series. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Anirudh Mittal, Timo Schick, Mikel Artetxe, Jane Dwivedi-Yu Evaluation of Faithfulness Using the Longest Supported Subsequence. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Amir Kazemi, Salar Basiri, Volodymyr V. Kindratenko, Srinivasa M. Salapaka Sequence Generation via Subsequence Similarity: Theory and Application to UAV Identification. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Bharath Reddy, Richard Fields Maximum Match Subsequence Alignment Algorithm Finely Grained (MMSAA FG). Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer Longest Common Subsequence with Gap Constraints. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader Parallel Longest Common SubSequence Analysis In Chapel. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Duncan Adamson Ranking and Unranking k-subsequence universal words. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Ling Chen, Chaodu Song, Xu Wang, Dachao Fu, Feifei Li CSCLog: A Component Subsequence Correlation-Aware Log Anomaly Detection Method. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Rao Li, Jyotishmoy Deka, Kaushik Deka An Algorithm for the Longest Common Subsequence and Substring Problem. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Chin-Chia Michael Yeh, Huiyuan Chen, Yujie Fan, Xin Dai, Yan Zheng 0001, Vivian Lai, Junpeng Wang, Zhongfang Zhuang, Liang Wang 0047, Wei Zhang 0189, Eamonn J. Keogh Ego-Network Transformer for Subsequence Classification in Time Series Data. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Xin Li 0006, Yu Zheng 0014 Streaming and Query Once Space Complexity of Longest Increasing Subsequence. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15André Frochaux, Sarah Kleest-Meißner Puzzling over Subsequence-Query Extensions: Disjunction and Generalised Gaps. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Rao Li, Jyotishmoy Deka, Kaushik Deka, Dorothy Li An Algorithm for the Constrained Longest Common Subsequence and Substring Problem. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Omer Cohen Sidon, Dana Ron Sample-based distance-approximation for subsequence-freeness. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Alireza Abdi, Masih Hajsaeedi, Mohsen Hooshmand Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic. Search on Bibsonomy Comput. Biol. Chem. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Rahul Kumar Vijay, Satyasai Jagannath Nanda Earthquake pattern analysis using subsequence time series clustering. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Aaron E. Naiman, Eliav Farber, Yossi Stein Cyclic longest common subsequence. Search on Bibsonomy Discret. Math. Algorithms Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Qi Ye, Tingting Cai, Xiang Ji, Tong Ruan, Hong Zheng Subsequence and distant supervision based active learning for relation extraction of Chinese medical texts. Search on Bibsonomy BMC Medical Informatics Decis. Mak. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Hendri Sutrisno, Frederick Kin Hing Phoa Anomalous variable-length subsequence detection in time series: mathematical formulation and a novel evolutionary algorithm based on clustering and swarm intelligence. Search on Bibsonomy Appl. Intell. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Jiangtao Peng, Mingrui Wang, Yuting Hu, Yuanlin Li Inverse problems associated with subsequence sums in Cp ⊕ Cp II. Search on Bibsonomy Discret. Math. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Wenjun Bai, Okito Yamashita, Junichiro Yoshimoto Learning task-agnostic and interpretable subsequence-based representation of time series and its applications in fMRI analysis. Search on Bibsonomy Neural Networks The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Xingyuan Wang 0001, Yining Su, Lin Liu, Hao Zhang, Shuhong Di Color image encryption algorithm based on Fisher-Yates scrambling and DNA subsequence operation. Search on Bibsonomy Vis. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Wen Liu, Mingrui Ma, Peng Wang Multi-Querying: A Subsequence Matching Approach to Support Multiple Queries. Search on Bibsonomy Informatica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Paul Boniol, Michele Linardi, Federico Roncallo, Themis Palpanas, Mohammed Meftah, Emmanuel Remy Correction to: Unsupervised and scalable subsequence anomaly detection in large data series. Search on Bibsonomy VLDB J. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich 0001 Discovering Multi-Dimensional Subsequence Queries from Traces - From Theory to Practice. Search on Bibsonomy BTW The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Tsung-Lin Lu, Kuo-Si Huang, Chang-Biau Yang An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend. Search on Bibsonomy IIAI-AAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Shunichi Tanaka Approximation Algorithms for the Longest Run Subsequence Problem. Search on Bibsonomy CPM The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Omer Cohen Sidon, Dana Ron Sample-Based Distance-Approximation for Subsequence-Freeness. Search on Bibsonomy ICALP The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Ádám Pintér, Sándor Szénási Longest Common Subsequence-based Source Code Similarity. Search on Bibsonomy SACI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Mason DiCicco, Daniel Reichman 0001 The Learning and Communication Complexity of Subsequence Containment. Search on Bibsonomy ISIT The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Abdallah Amine Melakhsou, Mireille Batton-Hubert Explainable Abnormal Time Series Subsequence Detection Using Random Convolutional Kernels. Search on Bibsonomy DeLTA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Ruhollah Jamali, Sanja Lazarova-Molnar Uncovering Competitor Pricing Patterns in the Danish Pharmaceutical Market via Subsequence Time Series Clustering: A Case Study. Search on Bibsonomy WSC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Jinpeng Hu, Dandan Guo, Yang Liu 0258, Zhuo Li, Zhihong Chen, Xiang Wan, Tsung-Hui Chang A Simple Yet Effective Subsequence-Enhanced Approach for Cross-Domain NER. Search on Bibsonomy AAAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yang Liu 0258, Jinpeng Hu, Zhihong Chen, Xiang Wan, Tsung-Hui Chang EASAL: Entity-Aware Subsequence-Based Active Learning for Named Entity Recognition. Search on Bibsonomy AAAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yizhuo Guo, Peng Xu, Keqi Liu, Anyi Zhang Anomaly Detection Method based on Multi-Source Subsequence Multi-View Fusion. Search on Bibsonomy ICCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Duncan Adamson Ranking and Unranking k-Subsequence Universal Words. Search on Bibsonomy WORDS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer Longest Common Subsequence with Gap Constraints. Search on Bibsonomy WORDS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Thi Phuong Quyen Nguyen, Trung Nghia Tran, Ton Nu Huong Giang Hoang, Thanh Tung Nguyen Timeseries Anomaly Detection Using SAX and Matrix Profiles Based Longest Common Subsequence. Search on Bibsonomy ICCS (2) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Chin-Chia Michael Yeh, Huiyuan Chen, Yujie Fan, Xin Dai, Yan Zheng 0001, Vivian Lai, Junpeng Wang, Zhongfang Zhuang, Liang Wang 0047, Wei Zhang 0189, Eamonn J. Keogh Ego-Network Transformer for Subsequence Classification in Time Series Data. Search on Bibsonomy IEEE Big Data The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Qichen Wang 0005, Shu Zhang 0005 Hybrid heuristics: for the repetition-free longest common subsequence problem with index-gene. Search on Bibsonomy BIBM The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yewei Shen, Zhiyuan Wang, Zongyu Li, Xinmeng Liu, Xuequn Shang, Yongtian Wang Enhanced RNA Sequence Representation through Sequence Masking and Subsequence Consistency Optimization. Search on Bibsonomy BIBM The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Xiaoyu He, Ray Li Approximating Binary Longest Common Subsequence in Almost-Linear Time. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Lusheng Wang 0001, Binhai Zhu Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. Search on Bibsonomy SPIRE The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Xin Li, Yu Zheng Streaming and Query Once Space Complexity of Longest Increasing Subsequence. Search on Bibsonomy COCOON (1) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader Parallel Longest Common SubSequence Analysis In Chapel. Search on Bibsonomy HPEC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Ryuichi Yagi, Yuma Naoi, Hiroaki Shiokawa Fast Correlated DNA Subsequence Search via Graph-Based Representation. Search on Bibsonomy iiWAS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Nairen Cao, Shang-En Huang, Hsin-Hao Su Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. Search on Bibsonomy SPAA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yan Gu 0001, Ziyang Men, Zheqi Shen, Yihan Sun 0001, Zijin Wan Parallel Longest Increasing Subsequence and van Emde Boas Trees. Search on Bibsonomy SPAA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15André Frochaux, Sarah Kleest-Meißner Puzzling over Subsequence-Query Extensions: Disjunction and Generalised Gaps. Search on Bibsonomy AMW The full citation details ... 2023 DBLP  BibTeX  RDF
15Duarte Folgado, Marília Barandas, Margarida Antunes, Maria Lua Nunes, Hui Liu 0035, Yale Hartmann, Tanja Schultz, Hugo Gamboa TSSEARCH: Time Series Subsequence Search Library. Search on Bibsonomy SoftwareX The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Naoko Sawada, Makoto Uemura, Issei Fujishiro Multi-dimensional time-series subsequence clustering for visual feature analysis of blazar observation datasets. Search on Bibsonomy Astron. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Jin-Hui Fang, Guoyou Qian An extremal problem in subsequence sum. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Yoshifumi Sakai, Shunsuke Inenaga A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Ting-Wei Liang, Chang-Biau Yang, Kuo-Si Huang An efficient algorithm for the longest common palindromic subsequence problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Mohammad Tawhidul Hasan Bhuiyan, Muhammad Rashed Alam, M. Sohel Rahman Computing the longest common almost-increasing subsequence. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 1232 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license