default search action
Qiang Yu 0003
Person information
- affiliation: Xidian University, School of Computer Science and Technology, Xi'an, China
Other persons with the same name
- Qiang Yu — disambiguation page
- Qiang Yu 0001 — Worldcom Inc., Tulsa, OK, USA (and 1 more)
- Qiang Yu 0002 — Stevens Institute of Technology, Department of Mechanical Engineering, Hoboken, NJ, USA
- Qiang Yu 0004
— University of Queensland, Centre for Advanced Imaging, St. Lucia, QLD, Australia
- Qiang Yu 0005
- Qiang Yu 0006
- Qiang Yu 0007
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Qiang Yu
An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence Datasets. IEEE ACM Trans. Comput. Biol. Bioinform. 21(5): 1542-1551 (2024) - 2023
- [j8]Qiang Yu
A Method for Predicting DNA Motif Length Based On Deep Learning. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 61-73 (2023) - [j7]Jingfen Lan
LDSSNV: A Linkage Disequilibrium-Based Method for the Detection of Somatic Single-Nucleotide Variants. IEEE ACM Trans. Comput. Biol. Bioinform. 20(5): 3020-3032 (2023)
2010 – 2019
- 2019
- [j6]Qiang Yu
A New Efficient Algorithm for Quorum Planted Motif Search on Large DNA Datasets. IEEE Access 7: 129617-129626 (2019) - [j5]Qiang Yu, Xiang Zhao, Hongwei Huo
A new algorithm for DNA motif discovery using multiple sample sequence sets. J. Bioinform. Comput. Biol. 17(4): 1950021:1-1950021:19 (2019) - 2018
- [j4]Qiang Yu, Dingbang Wei, Hongwei Huo
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets. BMC Bioinform. 19(1): 228:1-228:16 (2018) - 2016
- [j3]Qiang Yu, Hongwei Huo
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search. BMC Bioinform. 17(S-9): 266 (2016) - [c6]Hongwei Huo
CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment. DCC 2016: 271-278 - 2015
- [j2]Qiang Yu, Hongwei Huo
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. IEEE ACM Trans. Comput. Biol. Bioinform. 12(2): 384-397 (2015) - [c5]Hongwei Huo
A Data-Aware FM-index. ALENEX 2015: 10-23 - [c4]Qiang Yu, Hongwei Huo
Reference sequence selection for motif searches. BIBM 2015: 569-574 - 2014
- [c3]Qiang Yu, Hongwei Huo
An efficient motif finding algorithm for large DNA data sets. BIBM 2014: 397-402 - 2013
- [j1]Yipu Zhang, Hongwei Huo
A Heuristic Cluster-Based EM Algorithm for the Planted (L, d) Problem. J. Bioinform. Comput. Biol. 11(4) (2013) - [c2]Qiang Yu, Hongwei Huo
StemFinder: An efficient algorithm for searching motif stems over large alphabets. BIBM 2013: 473-476 - 2012
- [c1]Hongwei Huo
A MapReduce-based Algorithm for Motif Search. IPDPS Workshops 2012: 2052-2060
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: