## Stem longest$ (all stems)

### 18 papers:

- DATE-2013-SauerRSPB #performance #satisfiability
- Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.
- VLDB-2013-LiUYG #correlation #database #sequence
- Discovering Longest-lasting Correlation in Sequence Databases (YL, LHU, MLY, ZG), pp. 1666–1677.
- LATA-2013-Blanchet-SadriL #problem #word
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
- DATE-2012-JiangSCBP #algorithm #constraints #generative #memory management #on the
- On the optimality of K longest path generation algorithm under memory constraints (JJ, MS, AC, BB, IP), pp. 418–423.
- LATA-2012-BilleGK
- Longest Common Extensions via Fingerprinting (PB, ILG, JK), pp. 119–130.
- ICPR-2012-KusumaSLL #recognition #sequence #using
- Appearance-based object recognition using weighted longest increasing subsequence (GPK, AS, YL, JAL), pp. 3668–3671.
- DocEng-2011-GippM #algorithm #detection #pattern matching #sequence
- Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence (BG, NM), pp. 249–258.
- LATA-2010-Arslan #algorithm #performance #sequence #string
- A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.
- CIAA-2007-IliopoulosRVV #problem #sequence #string
- The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.
- MLDM-2007-HanKK #performance #sequence #using
- Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index (TSH, SKK, JK), pp. 585–600.
- CIKM-2006-GollapudiP06a #approximate #string #taxonomy
- A dictionary for approximate string search and longest prefix search (SG, RP), pp. 768–775.
- ICALP-2004-BjorklundHK #approximate
- Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.
- CIAA-2003-MelicharP #approach #automaton #finite #problem #sequence
- The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
- ICALP-2001-LinCJW #problem #sequence
- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations (GHL, ZZC, TJ, JW), pp. 444–455.
- DATE-2000-TangWT #evaluation #performance #sequence
- Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation (XT, DFW, RT), pp. 106–111.
- ICALP-1994-JiangL #approximate #on the #sequence
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.
- SAC-1993-Kim #problem #program transformation #set
- Program Transformation for the Longest Upsequence Set Problem (HK), pp. 609–613.
- DAC-1989-McGeerB89a #algorithm #network #performance
- Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network (PCM, RKB), pp. 561–567.