|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 7 keywords
|
|
|
|
|
Results
Found 3 publication records. Showing 3 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Comparing Genomes with Duplications: A Computational Complexity Point of View.  |
IEEE/ACM Trans. Comput. Biology Bioinform.  |
2007 |
DBLP DOI BibTeX RDF |
maximum adjacency disruption number, summed adjacency disruption number, computational complexity, Comparative genomics, common intervals |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.  |
RECOMB-CG  |
2007 |
DBLP DOI BibTeX RDF |
breakpoint distance, heuristic, genome rearrangement, duplication, pseudo-boolean programming |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette |
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.  |
Comparative Genomics  |
2006 |
DBLP DOI BibTeX RDF |
heuristic, genome rearrangement, duplication, common intervals, pseudo-boolean programming |
Displaying result #1 - #3 of 3 (100 per page; Change: )
|
|