![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 131 matches
- 2024
- Elahe Khayatian
, Gabriel Valiente
, Louxin Zhang:
The k-Robinson-Foulds Dissimilarity Measures for Comparison of Labeled Trees. J. Comput. Biol. 31(4): 328-344 (2024) - Yufeng Wu
, Louxin Zhang:
Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees. J. Comput. Biol. 31(4): 345-359 (2024) - Cédric Chauve, Caroline Colijn, Louxin Zhang:
A Vector Representation for Phylogenetic Trees. CoRR abs/2405.07110 (2024) - 2023
- Elahe Khayatian, Gabriel Valiente, Louxin Zhang:
The K-Robinson Foulds Measures for Labeled Trees. RECOMB-CG 2023: 146-161 - Yufeng Wu, Louxin Zhang:
Bounding the Number of Reticulations in a Tree-Child Network that Displays a Set of Trees. RECOMB-CG 2023: 162-178 - 2022
- Yurui Chen, Louxin Zhang:
How much can deep learning improve prediction of the responses to drugs in cancer cell lines? Briefings Bioinform. 23(1) (2022) - Michael Fuchs, Guan-Ru Yu
, Louxin Zhang
:
Asymptotic enumeration and distributional properties of galled networks. J. Comb. Theory A 189: 105599 (2022) - Louxin Zhang
:
The Sackin Index of Simplex Networks. RECOMB-CG 2022: 52-67 - 2021
- Katharina Jahn, Niko Beerenwinkel, Louxin Zhang
:
The Bourque distances for mutation trees of cancers. Algorithms Mol. Biol. 16(1): 9 (2021) - Jinyu Chen, Louxin Zhang:
A survey and systematic assessment of computational methods for drug response prediction. Briefings Bioinform. 22(1): 232-246 (2021) - Michael Fuchs, Guan-Ru Yu
, Louxin Zhang:
On the asymptotic growth of the number of tree-child networks. Eur. J. Comb. 93: 103278 (2021) - Rohan B. H. Williams, Louxin Zhang:
Introduction to the Special Issue of the 18th Annual International RECOMB Satellite Workshop on Comparative Genomics. J. Bioinform. Comput. Biol. 19(6): 2102003:1-2102003:4 (2021) - Louxin Zhang
, Shaoliang Peng
, Yi-Ping Phoebe Chen
, David Sankoff, Guoliang Li, Hong-Yu Zhang:
Guest Editorial for the 17th Asia Pacific Bioinformatics Conference. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2123-2124 (2021) - 2020
- Andreas D. M. Gunawan, Jeyaram Rathin, Louxin Zhang
:
Counting and enumerating galled networks. Discret. Appl. Math. 283: 644-654 (2020) - Gabriel Cardona
, Louxin Zhang
:
Counting and enumerating tree-child networks and their subclasses. J. Comput. Syst. Sci. 114: 84-104 (2020) - Katharina Jahn, Niko Beerenwinkel, Louxin Zhang:
The Bourque Distances for Mutation Trees of Cancers. WABI 2020: 14:1-14:22 - Louxin Zhang:
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks. WALCOM 2020: 22-27 - 2019
- Rudi Alberts
, Jinyu Chen, Louxin Zhang
:
ZDOG: zooming in on dominating genes with mutations in cancer pathways. BMC Bioinform. 20(1): 740 (2019) - Louxin Zhang:
Generating normal networks via leaf insertion and nearest neighbor interchange. BMC Bioinform. 20-S(20): 642 (2019) - Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang:
Compression of Phylogenetic Networks and Algorithm for the Tree Containment Problem. J. Comput. Biol. 26(3): 285-294 (2019) - Louxin Zhang:
Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange. CoRR abs/1906.12053 (2019) - 2018
- Wandrille Duchemin
, Guillaume Gence, Anne-Muriel Arigon Chifolleau, Lars Arvestad
, Mukul S. Bansal, Vincent Berry
, Bastien Boussau, François Chevenet
, Nicolas Comte, Adrián A. Davín, Christophe Dessimoz
, David Dylus, Damir Hasic, Diego Mallo, Rémi Planel, David Posada
, Céline Scornavacca, Gergely J. Szöllosi
, Louxin Zhang, Eric Tannier, Vincent Daubin:
RecPhyloXML: a format for reconciled gene trees. Bioinform. 34(21): 3646-3652 (2018) - Hongwei Yan, Andreas D. M. Gunawan, Louxin Zhang:
S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks. Bioinform. 34(17): i680-i686 (2018) - Philippe Gambette
, Andreas D. M. Gunawan, Anthony Labarre
, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246: 62-79 (2018) - Yi-Hua Yang, Chung-Shou Liao, Xin Han, Louxin Zhang:
Online buffer management for transmitting packets with processing cycles. Theor. Comput. Sci. 723: 73-83 (2018) - Andreas D. M. Gunawan, Bingxin Lu, Louxin Zhang:
Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks. CoRR abs/1801.04498 (2018) - Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang:
The compressions of reticulation-visible networks are tree-child. CoRR abs/1806.07625 (2018) - 2017
- Bingxin Lu
, Louxin Zhang, Hon Wai Leong:
A program to compute the soft Robinson-Foulds distance between phylogenetic networks. BMC Genom. 18(S2) (2017) - Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252: 161-175 (2017) - Yu Zheng, Louxin Zhang:
Reconciliation With Nonbinary Gene Trees Revisited. J. ACM 64(4): 24:1-24:28 (2017)
skipping 101 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 14:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint