4 research outputs found
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
This paper provides a short and transparent solution for the covering cost of
white-grey trees which play a crucial role in the algorithm of Bergeron {\it et
al.}\ to compute the rearrangement distance between two multichromosomal
genomes in linear time ({\it Theor. Comput. Sci.}, 410:5300-5316, 2009). In the
process it introduces a new {\em center} notion for trees, which seems to be
interesting on its own.Comment: 6 pages, submitte
HalmazelmĂ©let; PartĂciĂł kalkulus, VĂ©gtelen gráfok elmĂ©lete = Set Theory; Partition Calculus , Theory of Infinite Graphs
ElĹ‘zetes tervĂĽnknek megfelelĹ‘en a halmazelmĂ©let alábbi terĂĽletein vĂ©geztĂĽnk kutatást Ă©s Ă©rtĂĽnk el számos eredmĂ©nyt: I. Kombinatorika II. A valĂłsak számsosságinvariánsai Ă©s ideálelmĂ©let III. HalmazelmĂ©leti topolĂłgia Ezek mellett Sági Gábor kiterjedt kutatást vĂ©gzett a modellelmĂ©let terĂĽletĂ©n , amely eredmĂ©nyek kapcsolĂłdnak a kombinatorikához is. EredmĂ©nyeinket 38 közlemĂ©nyben publikáltuk, amelyek majdnem mind az adott terĂĽlet vezetĹ‘ nemzetközi lapjaiban jelentel meg (5 cikket csak benyĂşjtottunk). Számos nemzetközi konferencián is rĂ©sztvettĂĽnk, Ă©s hárman közűlĂĽnk (Juhász, Sádi, Soukup) plenáris/meghĂvott elĹ‘adĂłk voltak számos alkalommal. | Following our research plan, we have mainly done research -- and established a number of significant results -- in several areas of set theory: I. Combinatorics II. Cardinal invariants of the continuum and ideal theory III. Set-theoretic topology In addition to these, G. Sági has done extended research in model theory that had ramifications to combinatorics. We presented our results in 38 publications, almost all of which appeared or will appear in the leading international journals of these fields (5 of these papers have been submitted but not accepted as yet). We also participated at a number of international conferences, three of us (Juhász, Sági, Soukup) as plenary and/or invited speakers at many of these
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Erdős PL, Soukup L, Stoye J. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. Applied Mathematics Letters. 2011;24(1):82-86