◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Wenfeng Lai

2 papers hereh-index 315 citations6 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

collaborators

2 papers

cs.DS2023

The Longest Subsequence-Repeated Subsequence Problem

Manuel Lafond, Wenfeng Lai, Adiesha Liyanage +1

Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence S of…

cs.DS2022

Beyond the Longest Letter-duplicated Subsequence Problem

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu +1

Given a sequence S of length n, a letter-duplicated subsequence is a subsequence of S in the form of x1d1​​x2d2​​⋯xkdk​​ with xi​∈Σ, xj​=xj+1​ an…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.