Author image not provided
 Quang Bao Anh Bui

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.14
Citation Count29
Publication count7
Publication years2008-2012
Available for download1
Average downloads per article195.00
Downloads (cumulative)195
Downloads (12 Months)32
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1 published by ACM
January 2012 ACM Transactions on Algorithms (TALG): Volume 8 Issue 1, January 2012
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 32,   Downloads (Overall): 195

Full text available: PDFPDF
In computational phylogenetics, the problem of constructing a consensus tree for a given set of rooted input trees has frequently been addressed. In this article we study the Minimum-Flip Problem : the input trees are transformed into a binary matrix, and we want to find a perfect phylogeny for this ...
Keywords: Phylogenetics, consensus tree, fixed-parameter algorithm

2
March 2011 Theoretical Computer Science: Volume 412 Issue 12-14, March, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

In this paper, we deal with restoring missing information in molecule databases: Many data formats only store the atoms' configuration but omit bond multiplicities. As this information is essential for various applications in chemistry, we consider the problem of recovering bond type information using a scoring function for the possible ...
Keywords: FPT, Fixed-parameter tractability, Bond order assignment, MAX SNP-hard, Bioinformatics, NP-hard, Tree decomposition

3
March 2011 Bioinformatics: Volume 27 Issue 5, March 2011
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 1

Motivation: Numerous applications in Computational Biology process molecular structures and hence strongly rely not only on correct atomic coordinates but also on correct bond order information. For proteins and nucleic acids, bond orders can be easily deduced but this does not hold for other types of molecules like ligands. For ...

4
December 2009 Theoretical Computer Science: Volume 410 Issue 52, December, 2009
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 15

The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper, we present a ...
Keywords: Fixed-parameter tractability, Data clustering, Exact algorithms

5
July 2009 COCOON '09: Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms' configuration but omit bond multiplicities. As this information is essential for various applications in chemistry, we consider the problem of recovering bond type information using a scoring function for the possible ...

6
August 2008 COCOA 2008: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

The goal of the <Emphasis Type="SmallCaps">Cluster Editing</Emphasis>problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper we present a ...

7
May 2008 IWPEC'08: Proceedings of the 3rd international conference on Parameterized and exact computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

In computational phylogenetics, the problem of constructinga consensus tree for a given set of input trees has frequently been addressed.In this paper we study the Minimum-Flip Problem: the inputtrees are transformed into a binary matrix, and we want to find a perfectphylogeny for this matrix using a minimum number of ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us