@article{Angeleska-Jonoska-Saito/12,
AUTHOR = {Angeleska, Angela and Jonoska, Nata{\v{s}}a and Saito, Masahico},
TITLE = {Rewriting rule chains modeling DNA rearrangement pathways},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {5-22},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {assembly pathways, dna rearrangement, rewriting rules, ciliates},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004069},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Apostolico-Erdos-Juttner/12,
AUTHOR = {Apostolico, Alberto and Erd{\H{o}}s, P{\'e}ter L. and J{\"u}ttner, Alp{\'a}r},
TITLE = {Parameterized searching with mismatches for run-length encoded strings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {23-29},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {string searching, parameterized matching, bipartite graphs, parametric graph matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002381},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Azimi-Harju-Langille-Petre/12,
AUTHOR = {Azimi, Sepinoud and Harju, Tero and Langille, Miika and Petre, Ion},
TITLE = {Simple gene assembly as a rewriting of directed overlap-inclusion graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {30-37},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {simple gene assembly, directed overlap inclusion graphs, graph-based simple operations},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003623},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-Daley-McQuillan/12,
AUTHOR = {Biegler, Franziska and Daley, Mark and McQuillan, Ian},
TITLE = {Algorithmic decomposition of shuffle on words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {38-50},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {shuffle decomposition, finite languages, finite automata, words},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003234},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonizzoni-Braghin-Dondi-Trucco/12,
AUTHOR = {Bonizzoni, Paola and Braghin, Chiara and Dondi, Riccardo and Trucco, Gabriella},
TITLE = {The binary perfect phylogeny with persistent characters},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {51-63},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512005294},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brijder-Harju-Hoogeboom/12,
AUTHOR = {Brijder, Robert and Harju, Tero and Hoogeboom, Hendrik Jan},
TITLE = {Pivots, determinants, and perfect matchings of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {64-71},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {principal pivot transform, perfect matchings, gene assembly in ciliates, local complementation, circle graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512001831},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calude-Calude-Queen/12,
AUTHOR = {Calude, Cristian S. and Calude, Elena and Queen, Melissa S.},
TITLE = {The complexity of Euler's integer partition theorem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {72-80},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complexity of mathematical problems, euler's integer partition theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002563},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chiniforooshan-Daley-Ibarra-Kari-Seki/12,
AUTHOR = {Chiniforooshan, Ehsan and Daley, Mark and Ibarra, Oscar H. and Kari, Lila and Seki, Shinnosuke},
TITLE = {One-reversal counter machines and multihead automata: Revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {81-87},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reversal-bounded counter machine, multihead automaton, bounded language, inclusion, incomparability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003246},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-Grigorieff/12,
AUTHOR = {Choffrut, Christian and Grigorieff, Serge},
TITLE = {Rational relations having a rational trace on each finite intersection of rational relations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {88-94},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, rational relation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002319},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Corolli-Maj-Marini-Besozzi-Mauri/12,
AUTHOR = {Corolli, Luca and Maj, Carlo and Marini, Fabrizio and Besozzi, Daniela and Mauri, Giancarlo},
TITLE = {An excursion in reaction systems: From computer science to biology},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {95-108},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reaction systems, boolean functions, simplification methods, tower of hanoi, lac operon},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003258},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Luca-De_Luca/12,
AUTHOR = {de Luca, Aldo and De Luca, Alessandro},
TITLE = {A generalized palindromization map in free monoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {109-128},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {palindromic closure, episturmian words, arnoux-rauzy words, generalized palindromization map, pseudopalindromes},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512000655},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diekert-Kufleitner-Weil/12,
AUTHOR = {Diekert, Volker and Kufleitner, Manfred and Weil, Pascal},
TITLE = {Star-free languages are Church-Rosser congruential},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {129-135},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {string rewriting, church-rosser system, star-free language, aperiodic monoid, local divisor},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512000643},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gabow/12,
AUTHOR = {Gabow, Harold N.},
TITLE = {A combinatoric interpretation of dual variables for weighted matching and $f$-factors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {136-163},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph, matching, b -matching, f -factor, blossom, dual variables},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006068},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Kari-Yu/12a,
AUTHOR = {Gao, Yuan and Kari, Lila and Yu, Sheng},
TITLE = {State complexity of union and intersection of square and reversal on regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {164-171},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {state complexity, combined operations, regular languages, finite automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003180},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huova-Karhumaki-Saarela/12,
AUTHOR = {Huova, Mari and Karhum{\"a}ki, Juhani and Saarela, Aleksi},
TITLE = {Problems in between words and Abelian words: $k$-Abelian avoidability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {172-177},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, k -abelian equivalence, avoidability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002307},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jolivet-Kari/12a,
AUTHOR = {Jolivet, Timo and Kari, Jarkko},
TITLE = {Consistency of multidimensional combinatorial substitutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {178-188},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003222},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kleijn-Koutny-Pietkiewicz-Koutny/12,
AUTHOR = {Kleijn, Jetty and Koutny, Maciej and Pietkiewicz-Koutny, Marta},
TITLE = {Regions of Petri nets with a/sync connections},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {189-198},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, transition system, petri net, theory of regions, synthesis problem, place transition net, step sequence semantics, synchronous and asynchronous communication, a/sync connection},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200360X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mignosi-Restivo/12,
AUTHOR = {Mignosi, Filippo and Restivo, Antonio},
TITLE = {Characteristic Sturmian words are extremal for the Critical Factorization Theorem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {199-205},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, periodicity, sturmian words, critical factorization theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002320},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Okubo-Kobayashi-Yokomori/12a,
AUTHOR = {Okubo, Fumiya and Kobayashi, Satoshi and Yokomori, Takashi},
TITLE = {On the properties of language classes defined by bounded reaction automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {206-221},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {biochemical reaction model, bounded reaction automata, abstract family of languages, closure property},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002575},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Paun-Perez-Jimenez/12b,
AUTHOR = {P{\v{a}}un, Gheorghe and P{\'e}rez-Jim{\'e}nez, Mario J.},
TITLE = {P automata revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {222-230},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, p automata, turing computability, closure properties},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512000837},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Piao-Salomaa/12a,
AUTHOR = {Piao, Xiaoxue and Salomaa, Kai},
TITLE = {Lower bounds for the size of deterministic unranked tree automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {231-239},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree automata, unranked trees, state complexity, lower bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003155},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Skowron-Wasilewski/12,
AUTHOR = {Skowron, Andrzej and Wasilewski, Piotr},
TITLE = {Interactive information systems: Toward perception based computing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {454},
PAGES = {240-260},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interactive computing, interactive information systems, interactive tables, rough sets, granular computing, wisdom technology},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003635},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}