default search action
Songjian Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j15]Lifan Liang
, Kunju Zhu
ORN: Inferring patient-specific dysregulation status of pathway modules in cancer with OR-gate Network. PLoS Comput. Biol. 17(4) (2021) - 2020
- [j14]Lifan Liang
BEM: Mining Coregulation Patterns in Transcriptomics via Boolean Matrix Factorization. Bioinform. 36(13): 4030-4037 (2020)
2010 – 2019
- 2019
- [j13]Xiao-Nan Fan, Shao-Wu Zhang
Prediction of lncRNA-disease associations by integrating diverse heterogeneous information sources with RWR algorithm and positive pointwise mutual information. BMC Bioinform. 20(1): 87:1-87:12 (2019) - [j12]Lifan Liang, Vicky Chen, Kunju Zhu
Integrating data and knowledge to identify functional modules of genes: a multilayer approach. BMC Bioinform. 20(1): 225:1-225:15 (2019) - [j11]Chunhui Cai
Systematic discovery of the functional impact of somatic genome alterations in individual tumors through tumor-specific causal inference. PLoS Comput. Biol. 15(7) (2019) - [i4]Lifan Liang, Songjian Lu:
Noisy and Incomplete Boolean Matrix Factorizationvia Expectation Maximization. CoRR abs/1905.12766 (2019) - 2016
- [j10]Songjian Lu, Gunasheil Mandava, Gaibo Yan, Xinghua Lu:
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem. Algorithms Mol. Biol. 11: 11 (2016) - 2015
- [j9]Songjian Lu, Kevin N. Lu, Shi-Yuan Cheng, Bo Hu, Xiaojun Ma, Nicholas Nystrom, Xinghua Lu:
Identifying Driver Genomic Alterations in Cancers by Searching Minimum-Weight, Mutually Exclusive Sets. PLoS Comput. Biol. 11(8) (2015) - [c10]Songjian Lu, Kevin N. Lu, Shi-Yuan Cheng, Bo Hu, Xiaojun Ma, Nicholas Nystrom, Xinghua Lu:
Identifying driver genomic alterations in cancers by searching minimum-weight, mutually exclusive sets. BIBM 2015: 1728-1730 - 2014
- [i3]Songjian Lu, Xinghua Lu:
An exact algorithm for the weighed mutually exclusive maximum set cover problem. CoRR abs/1401.6385 (2014) - 2013
- [j8]Songjian Lu, Xinghua Lu:
Using graph model to find transcription factor modules: the hitting set problem and an exact algorithm. Algorithms Mol. Biol. 8: 2 (2013) - [i2]Songjian Lu, Xinghua Lu:
An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem. CoRR abs/1302.5820 (2013) - 2012
- [j7]Jianer Chen, Yang Liu, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. ACM Trans. Algorithms 8(1): 6:1-6:22 (2012) - 2011
- [j6]Jianer Chen, Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang:
Improved deterministic algorithms for weighted matching and packing problems. Theor. Comput. Sci. 412(23): 2503-2512 (2011) - [c9]Songjian Lu, Xinghua Lu:
A graph model and an exact algorithm for finding transcription factor modules. BCB 2011: 355-359
2000 – 2009
- 2009
- [j5]Jianer Chen, Songjian Lu:
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. Algorithmica 54(4): 472-489 (2009) - [j4]Jianer Chen, Yang Liu, Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica 55(1): 1-13 (2009) - [c8]Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang:
Improved Deterministic Algorithms for Weighted Matching and Packing Problems. TAMC 2009: 211-220 - 2008
- [j3]Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan
A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5): 21:1-21:19 (2008) - [j2]Jianer Chen, Fedor V. Fomin
Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008) - [c7]Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. STOC 2008: 177-186 - 2007
- [j1]Songjian Lu, Fenghui Zhang, Jianer Chen, Sing-Hoi Sze:
Finding Pathway Structures in Protein Interaction Networks. Algorithmica 48(4): 363-374 (2007) - [c6]Jianer Chen, Songjian Lu:
Improved Algorithms for Weighted and Unweighted Set Splitting Problems. COCOON 2007: 537-547 - [c5]Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Improved algorithms for path, matching, and packing problems. SODA 2007: 298-307 - [c4]Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433 - [c3]Jianer Chen, Yang Liu, Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. WADS 2007: 495-506 - [i1]Jianer Chen, Yang Liu, Songjian Lu:
Directed Feedback Vertex Set Problem is FPT. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - 2006
- [c2]Yang Liu, Songjian Lu, Jianer Chen, Sing-Hoi Sze:
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. IWPEC 2006: 84-95 - 2004
- [c1]Sing-Hoi Sze, Songjian Lu, Jianer Chen:
Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. WABI 2004: 438-449
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-12-05 21:38 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: