• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 370 matches

• 2021
• 
  Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl:
  Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021)
• 
  Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
  An A^⁎ search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166: 106041 (2021)
• 
  Toan Thang Ta, Yi-Kung Shieh, Chin Lung Lu:
  Computing a longest common almost-increasing subsequence of two sequences. Theor. Comput. Sci. 854: 44-51 (2021)
• 2020
• 
  Marko Djukanovic, Günther R. Raidl, Christian Blum:
  Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95: 106499 (2020)
• 
  Shiwei Wei, Yuping Wang, Yuanchao Yang, Sen Liu:
  A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems. Bioinform. 36(10): 3035-3042 (2020)
• 
  Mohamed Slim Kammoun:
  On the Longest Common Subsequence of Conjugation Invariant Random Permutations. Electron. J. Comb. 27(4): P4.10 (2020)
• 
  Marko Djukanovic, Günther R. Raidl, Christian Blum:
  Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020)
• 
  Joakim Blikstad:
  On the longest common subsequence of Thue-Morse words. Inf. Process. Lett. 164: 106020 (2020)
• 
  Armel Nkonjoh Ngomade, Jean Frédéric Myoupo, Vianney Kengne Tchendji:
  A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. J. Comput. Sci. 40: 101070 (2020)
• 
  Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean Frédéric Myoupo:
  Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. Parallel Comput. 91 (2020)
• 
  Boris Bukh, Raymond Hogenson:
  Length of the Longest Common Subsequence between Overlapping Words. SIAM J. Discret. Math. 34(1): 721-729 (2020)
• 
  Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
  Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838: 238-249 (2020)
• 
  Shou-Fu Lo, Kuo-Tsung Tseng, Chang-Biau Yang, Kuo-Si Huang:
  A diagonal-based algorithm for the longest common increasing subsequence problem. Theor. Comput. Sci. 815: 69-78 (2020)
• 
  Anni Jia, Wei Yang, Gongxuan Zhang:
  Side Channel Leakage Alignment Based on Longest Common Subsequence. BigDataSE 2020: 130-137
• 
  Evangelos Kipouridis, Kostas Tsichlas:
  Longest Common Subsequence on Weighted Sequences. CPM 2020: 19:1-19:15
• 
  Anadi Agrawal, Pawel Gawrychowski:
  A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ISAAC 2020: 4:1-4:12
• 
  Wang Xuan, Ziyang Chen, Lusha Zhai:
  An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence. NLPIR 2020: 200-204
• 
  Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
  On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA 2020: 55-70
• 
  Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl:
  On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA 2020: 134-149
• 
  Aviad Rubinstein, Zhao Song:
  Reducing approximate Longest Common Subsequence to approximate Edit Distance. SODA 2020: 1591-1600
• 
  Lech Duraj:
  A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. STACS 2020: 41:1-41:18
• 
  Anadi Agrawal, Pawel Gawrychowski:
  A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. CoRR abs/2003.13589 (2020)
• 
  Sepideh Aghamolaei:
  A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings. CoRR abs/2008.01768 (2020)
• 
  Jin Cao, Dewei Zhong:
  A Fast Randomized Algorithm for Finding the Maximal Common Subsequences. CoRR abs/2009.03352 (2020)
• 
  Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
  Longest Common Subsequence in Sublinear Space. CoRR abs/2009.08588 (2020)
• 
  Jianming Huang, Zhongxi Fang, Hiroyuki Kasai:
  LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space. CoRR abs/2012.03612 (2020)
• 2019
• 
  Lech Duraj, Marvin Künnemann, Adam Polak:
  Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica 81(10): 3968-3992 (2019)
• 
  C. Houdré, G. Kerchev:
  On the rate of convergence for the length of the longest common subsequences in hidden Markov models. J. Appl. Probab. 56(2): 558-573 (2019)
• 
  Xiaodong Wang, Lei Wang, Daxin Zhu:
  Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. J. Comput. Biol. 26(9): 938-947 (2019)
• 
  Md. Rafiqul Islam, C. M. Khaled Saifullah, Zarrin Tasnim Asha, Rezoana Ahamed:
  Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Comput. 23(14): 5485-5509 (2019)

skipping 340 more matches