VLDB 2026 Research / reviewers in the wild / expert
Jingfen Lan
dblp:223/5339
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0002-0219-5791ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence DatasetsabstractDNA motif is the pattern shared by similar fragments in DNA sequences, which plays a key role in regulating gene expression, and DNA motif discovery has become a key research topic. Exact planted ( l, d )-motif search (PMS) is one of the motif discovery approaches, which aims to find from t sequences all the ( l, d )-motifs that are motifs of l length appearing in at least qt sequences with at most d mismatches. The existing exact PMS algorithms are only suitable for small datasets of DNA sequences. The development of high-throughput sequencing technology generates vast amount of DNA sequence data, which brings challenges to solving exact PMS problems efficiently. Therefore, we propose an efficient exact PMS algorithm called PMmotif for large datasets of DNA sequences, after analyzing the time complexity of the existing exact PMS algorithms. PMmotif finds ( l, d )-motifs with strategy by searching the branches on the pattern tree that may contain ( l, d )-motifs. It is verified by experiments that the running time ratio of some existing excellent PMS algorithms to PMmotif is between 14.83 and 58.94. In addition, for the first time, PMmotif can solve the ( 15,5 )and ( 17,6 ) challenge problem instances on large DNA sequence datasets (3000 sequences of length 200) within 24 hours. Qiang Yu 0003, Yana Hu, Xinnan Hu, Jingfen Lan |
IEEE ACM Trans. Comput. Biol. Bioinform. | 4 |
| 2023 | LDSSNV: A Linkage Disequilibrium-Based Method for the Detection of Somatic Single-Nucleotide VariantsabstractSingle nucleotide variants (SNVs) are very common in human genome and pose a significant effect on cellular proliferation and tumorigenesis in various cancers. Somatic variant and germline variant are the two forms of SNVs. They are the major drivers of inherited diseases and acquired tumors respectively. A reasonable analysis of the next generation sequencing data profiles from cancer genomes could provide crucial information for cancer diagnosis and treatment. Accurate detection of SNVs and distinguishing the two forms are still considered challenging tasks in cancer analysis. Herein, we propose a new approach, LDSSNV, to detect somatic SNVs without matched normal samples. LDSSNV predicts SNVs by training the XGboost classifier on a concise combination of features and distinguishes the two forms based on linkage disequilibrium which is a trait between germline mutations. LDSSNV provides two modes to distinguish the somatic variants from germline variants, the single-mode and multiple-mode by respectively using a single tumor sample and multiple tumor samples. The performance of the proposed method is assessed on both simulation data and real sequencing datasets. The analysis shows that the LDSSNV method outperforms competing methods and can become a robust and reliable tool for analyzing tumor genome variation. Jingfen Lan, Wenxiang Chen, Ganggang Yin, Haque A. K. Alvi, Kun Xie 0011, Qiang Yu 0003, Xiguo Yuan |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |
| 2021 | h-extra r-component connectivity of interconnection networks with application to hypercubes
Bi Li 0004, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang 0017, Qiang Zhu 0003 |
Theor. Comput. Sci. | 2 |
| 2018 | Light paths and edges in families of outer-1-planar graphs
Xin Zhang 0017, Jingfen Lan, Bi Li 0004, Qiang Zhu 0003 |
Inf. Process. Lett. | 2 |