Demo Data from EDBT 2026 / reviewers in the wild / expert
Lingxiao Lan
dblp:199/5089
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly |
0.3 | 1 | 2018 | ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018 |
Bioinformatics and computational biology
genomics |
0.3 | 1 | 2018 | ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018 |
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
misassembly detection |
0.3 | 1 | 2018 | ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018 |
Methods — techniques the papers use, named apart from their topics
short read alignment · 0.3long-read alignment · 0.3de bruijn graph · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | ReMILO: reference assisted misassembly detection algorithm using short and long readsabstractMotivation: Contigs assembled from the second generation sequencing short reads may contain misassemblies, and thus complicate downstream analysis or even lead to incorrect analysis results. Fortunately, with more and more sequenced species available, it becomes possible to use the reference genome of a closely related species to detect misassemblies. In addition, long reads of the third generation sequencing technology have been more and more widely used, and can also help detect misassemblies. Results: Here, we introduce ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies. In our performance test on short read assemblies of human chromosome 14 data, ReMILO can detect 41.8-77.9% extensive misassemblies and 33.6-54.5% local misassemblies. On hybrid short and long read assemblies of S.pastorianus data, ReMILO can also detect 60.6-70.9% extensive misassemblies and 28.6-54.0% local misassemblies. Availability and implementation: The ReMILO software can be downloaded for free under Artistic License 2.0 from this site: https://github.com/songc001/remilo. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online. Ergude Bao, Chang-Jin Song, Lingxiao Lan |
Bioinform. | 3 |
| 2017 | HALC: High throughput algorithm for long read error correctionabstractBACKGROUND: The third generation PacBio SMRT long reads can effectively address the read length issue of the second generation sequencing technology, but contain approximately 15% sequencing errors. Several error correction algorithms have been designed to efficiently reduce the error rate to 1%, but they discard large amounts of uncorrected bases and thus lead to low throughput. This loss of bases could limit the completeness of downstream assemblies and the accuracy of analysis. RESULTS: Here, we introduce HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region's repeats in the contigs sufficiently similar to it (similar repeat based alignment approach). It then constructs a contig graph and, for each long read, references the other long reads' alignments to find the most accurate alignment and correct it with the aligned contig regions (long read support based validation approach). Even though some long read regions without the true genome regions in the contigs are corrected with their repeats, this approach makes it possible to further refine these long read regions with the initial insufficient short reads and correct the uncorrected regions in between. In our performance tests on E. coli, A. thaliana and Maylandia zebra data sets, HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms. CONCLUSIONS: The HALC software can be downloaded for free from this site: https://github.com/lanl001/halc . Ergude Bao, Lingxiao Lan |
BMC Bioinform. | 2 |