Tree loop graphs

Autores
Alcón, Liliana Graciela; Cerioli, Márcia R.; Figueiredo, Celina M. H. de; Gutiérrez, Marisa; Meidanis, João
Año de publicación
2007
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Many problems involving DNA can be modeled by families of intervals. However, traditional interval graphs do not take into account the repeat structure of a DNA molecule. In the simplest case, one repeat with two copies, the underlying line can be seen as folded into a loop. We propose a new definition that respects repeats and define loop graphs as the intersection graphs of arcs of a loop. The class of loop graphs contains the class of interval graphs and the class of circular-arc graphs. Every loop graph has interval number 2. We characterize the trees that are loop graphs. The characterization yields a polynomial-time algorithm which given a tree decides whether it is a loop graph and, in the affirmative case, produces a loop representation for the tree.
Facultad de Ciencias Exactas
Materia
Matemática
Computational molecular biology
DNA fragment assembly problem
DNA physical mapping
Interval graphs
Interval number
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/82964
Acceder
id SEDICI_31cdcfe35f8ec13bd591d81d6ea0fead
oai_identifier_str oai:sedici.unlp.edu.ar:10915/82964
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Tree loop graphsAlcón, Liliana GracielaCerioli, Márcia R.Figueiredo, Celina M. H. deGutiérrez, MarisaMeidanis, JoãoMatemáticaComputational molecular biologyDNA fragment assembly problemDNA physical mappingInterval graphsInterval numberMany problems involving DNA can be modeled by families of intervals. However, traditional interval graphs do not take into account the repeat structure of a DNA molecule. In the simplest case, one repeat with two copies, the underlying line can be seen as folded into a loop. We propose a new definition that respects repeats and define loop graphs as the intersection graphs of arcs of a loop. The class of loop graphs contains the class of interval graphs and the class of circular-arc graphs. Every loop graph has interval number 2. We characterize the trees that are loop graphs. The characterization yields a polynomial-time algorithm which given a tree decides whether it is a loop graph and, in the affirmative case, produces a loop representation for the tree.Facultad de Ciencias Exactas2007info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf686-694http://sedici.unlp.edu.ar/handle/10915/82964enginfo:eu-repo/semantics/altIdentifier/issn/0166-218Xinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2005.01.001info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T16:56:33Zoai:sedici.unlp.edu.ar:10915/82964Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:56:33.325SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Tree loop graphs
title Tree loop graphs
spellingShingle Tree loop graphs
Alcón, Liliana Graciela
Matemática
Computational molecular biology
DNA fragment assembly problem
DNA physical mapping
Interval graphs
Interval number
title_short Tree loop graphs
title_full Tree loop graphs
title_fullStr Tree loop graphs
title_full_unstemmed Tree loop graphs
title_sort Tree loop graphs
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
Cerioli, Márcia R.
Figueiredo, Celina M. H. de
Gutiérrez, Marisa
Meidanis, João
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Cerioli, Márcia R.
Figueiredo, Celina M. H. de
Gutiérrez, Marisa
Meidanis, João
author_role author
author2 Cerioli, Márcia R.
Figueiredo, Celina M. H. de
Gutiérrez, Marisa
Meidanis, João
author2_role author
author
author
author
dc.subject.none.fl_str_mv Matemática
Computational molecular biology
DNA fragment assembly problem
DNA physical mapping
Interval graphs
Interval number
topic Matemática
Computational molecular biology
DNA fragment assembly problem
DNA physical mapping
Interval graphs
Interval number
dc.description.none.fl_txt_mv Many problems involving DNA can be modeled by families of intervals. However, traditional interval graphs do not take into account the repeat structure of a DNA molecule. In the simplest case, one repeat with two copies, the underlying line can be seen as folded into a loop. We propose a new definition that respects repeats and define loop graphs as the intersection graphs of arcs of a loop. The class of loop graphs contains the class of interval graphs and the class of circular-arc graphs. Every loop graph has interval number 2. We characterize the trees that are loop graphs. The characterization yields a polynomial-time algorithm which given a tree decides whether it is a loop graph and, in the affirmative case, produces a loop representation for the tree.
Facultad de Ciencias Exactas
description Many problems involving DNA can be modeled by families of intervals. However, traditional interval graphs do not take into account the repeat structure of a DNA molecule. In the simplest case, one repeat with two copies, the underlying line can be seen as folded into a loop. We propose a new definition that respects repeats and define loop graphs as the intersection graphs of arcs of a loop. The class of loop graphs contains the class of interval graphs and the class of circular-arc graphs. Every loop graph has interval number 2. We characterize the trees that are loop graphs. The characterization yields a polynomial-time algorithm which given a tree decides whether it is a loop graph and, in the affirmative case, produces a loop representation for the tree.
publishDate 2007
dc.date.none.fl_str_mv 2007
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/82964
url http://sedici.unlp.edu.ar/handle/10915/82964
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0166-218X
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2005.01.001
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
686-694
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846783172386226176
score 12.982451

Publicaciones similares