|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Laurent Bulteau, Minghui Jiang |
Inapproximability of (1, 2)-Exemplar Distance.  |
ISBRA  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Pancake Flipping is Hard |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions Is Difficult. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
Tractability and Approximability of Maximal Strip Recovery. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions is Difficult |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Revisiting the Minimum Breakpoint Linearization Problem. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity |
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")