IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v52y2007i2p725-736.html
   My bibliography  Save this article

Algorithms for compact letter displays: Comparison and evaluation

Author

Listed:
  • Gramm, Jens
  • Guo, Jiong
  • Huffner, Falk
  • Niedermeier, Rolf
  • Piepho, Hans-Peter
  • Schmid, Ramona

Abstract

No abstract is available for this item.

Suggested Citation

  • Gramm, Jens & Guo, Jiong & Huffner, Falk & Niedermeier, Rolf & Piepho, Hans-Peter & Schmid, Ramona, 2007. "Algorithms for compact letter displays: Comparison and evaluation," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 725-736, October.
    • Handle: RePEc:eee:csdana:v:52:y:2007:i:2:p:725-736
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(06)00359-8
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jochen Alber & Nadja Betzler & Rolf Niedermeier, 2006. "Experiments on data reduction for optimal domination in networks," Annals of Operations Research, Springer, vol. 146(1), pages 105-117, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Migle Janulaitiene & Vilmantas Gegzna & Lina Baranauskiene & Aistė Bulavaitė & Martynas Simanavicius & Milda Pleckaityte, 2018. "Phenotypic characterization of Gardnerella vaginalis subgroups suggests differences in their virulence potential," PLOS ONE, Public Library of Science, vol. 13(7), pages 1-20, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marjan Marzban & Qian-Ping Gu & Xiaohua Jia, 2016. "New analysis and computational study for the planar connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 198-225, July.
    2. Matthias Bentert & René van Bevern & André Nichterlein & Rolf Niedermeier & Pavel V. Smirnov, 2022. "Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 55-75, January.
    3. Rim Wersch & Steven Kelk & Simone Linz & Georgios Stamoulis, 2022. "Reflections on kernelizing and computing unrooted agreement forests," Annals of Operations Research, Springer, vol. 309(1), pages 425-451, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:52:y:2007:i:2:p:725-736. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.