( en | de | ru )

 

Disambiguation of "Zhang, Louxin"

Author of the publication

copydeleteadd this publication to your clipboard
A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications.

, , , , and . RECOMB-CG, volume 4751 of Lecture Notes in Computer Science, page 122-135. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zhang Zhang

Meng Zhang

Methods and implementations of road-network matching. TU München, (2009)

Shuying Zhang

Fuqing Zhang

Yong Zhang

 

Other publications of authors with the same name

Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis., , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 74-83. Springer, (2005)Small Weight Bases for Hamming Codes., , and . COCOON, volume 959 of Lecture Notes in Computer Science, page 235-243. Springer, (1995)Predicting chemotherapeutic drug combinations through gene network profiling., , , , , , , , , and 4 other author(s). Scientific reports, (2016)A Robust Method for Generating Discriminative Gene Clusters., , and . BIBE, page 538-545. IEEE Computer Society, (2007)A Tool for Non-binary Tree Reconciliation., and . ISBRA, volume 7875 of Lecture Notes in Computer Science, page 40-51. Springer, (2013)Counting and enumerating galled networks., , and . Discret. Appl. Math., (2020)Superiority and Complexity of the Spaced Seeds.. Encyclopedia of Algorithms, (2016)Online buffer management for transmitting packets with processing cycles., , , and . Theor. Comput. Sci., (2018)Bounding the Size of a Network Defined By Visibility Property., and . CoRR, (2015)Counting Motifs in the Entire Biological Network from Noisy and Incomplete Data - (Extended Abstract)., , and . RECOMB, volume 7821 of Lecture Notes in Computer Science, page 269-270. Springer, (2013)