@article{Breslauer-Grossi-Mignosi/13,
AUTHOR = {Breslauer, Dany and Grossi, Roberto and Mignosi, Filippo},
TITLE = {Simple real-time constant-space string matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {2-9},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010900},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dondi-Fertin-Vialette/13,
AUTHOR = {Dondi, Riccardo and Fertin, Guillaume and Vialette, St{\'e}phane},
TITLE = {Finding approximate and constrained motifs in graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {10-21},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph motif, computational biology, parameterized complexity, algorithms, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007979},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Thachuk/13,
AUTHOR = {Thachuk, Chris},
TITLE = {Compressed indexes for text with wildcards},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {22-35},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compressed indexes, text search, wildcard matching, dictionary matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007840},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie-Karkkainen-Navarro-Puglisi/13,
AUTHOR = {Gagie, Travis and K{\"a}rkk{\"a}inen, Juha and Navarro, Gonzalo and Puglisi, Simon J.},
TITLE = {Colored range queries and document retrieval},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {36-50},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data structures, 1d range queries, document retrieval, wavelet trees, information retrieval},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007657},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schirmer-Giegerich/13,
AUTHOR = {Schirmer, Stefanie and Giegerich, Robert},
TITLE = {Forest alignment with affine gaps and anchors, applied in RNA structure comparison},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {51-67},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rna structure alignment, forest alignment, affine gap costs, anchored alignment},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007499},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clifford-Jalsenius-Porat-Sach/13,
AUTHOR = {Clifford, Rapha{\"e}l and Jalsenius, Markus and Porat, Ely and Sach, Benjamin},
TITLE = {Space lower bounds for online pattern matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {68-74},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512005816},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferragina/13,
AUTHOR = {Ferragina, Paolo},
TITLE = {On the weak prefix-search problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {75-84},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {prefix search, compressed indexes for string dictionaries, weighted data structures, energy-efficient data structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512005804},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cantone-Cristofaro-Faro/13,
AUTHOR = {Cantone, Domenico and Cristofaro, Salvatore and Faro, Simone},
TITLE = {Efficient string-matching allowing for non-overlapping inversions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {85-95},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximate string matching, average complexity analysis, text processing, information retrieval},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512005452},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elberfeld-Segev-Davidson-Silverbush-Sharan/13,
AUTHOR = {Elberfeld, Michael and Segev, Danny and Davidson, Colin R. and Silverbush, Dana and Sharan, Roded},
TITLE = {Approximation algorithms for orienting mixed graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {96-103},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {protein-protein interaction network, mixed graph, graph orientation, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003167},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brown-Truszkowski/13,
AUTHOR = {Brown, Daniel G. and Truszkowski, Jakub},
TITLE = {Fast error-tolerant quartet phylogeny algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {104-114},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512001570},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kreft-Navarro/13,
AUTHOR = {Kreft, Sebastian and Navarro, Gonzalo},
TITLE = {On compressing and indexing repetitive sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {115-133},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compression, repetitive texts, self-indexing, lempel-ziv, succinct data structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512001259},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bauer-Cox-Rosone/13,
AUTHOR = {Bauer, Markus J. and Cox, Anthony J. and Rosone, Giovanna},
TITLE = {Lightweight algorithms for constructing and inverting the BWT of string collections},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {134-148},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bwt, text indexes, next-generation sequencing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512001211},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Daykin-Daykin-Smyth/13,
AUTHOR = {Daykin, David E. and Daykin, Jacqueline W. and Smyth, W.F.},
TITLE = {A linear partitioning algorithm for Hybrid Lyndons using $v$-order},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {149-161},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithm, alphabet, circ-umff, concatenate, factor, hybrid lyndon, lexicographic order, lyndon, maximal, ram, string, total order, umff, v -order, word, v -word},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200120X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{I-Inenaga-Takeda/13,
AUTHOR = {I, Tomohiro and Inenaga, Shunsuke and Takeda, Masayuki},
TITLE = {Palindrome pattern matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {162-170},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {palindromes, pattern matching, linear time algorithms, border arrays, suffix trees},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512001041},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Christou-Crochemore-Iliopoulos-Kubica-Pissis-Radoszewski-Rytter-Szreder-Walen/13,
AUTHOR = {Christou, M. and Crochemore, M. and Iliopoulos, C.S. and Kubica, M. and Pissis, S.P. and Radoszewski, J. and Rytter, W. and Szreder, B. and Wale{\'n}, T.},
TITLE = {Efficient seed computation revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {483},
PAGES = {171-181},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {seed in a string, cover, suffix tree},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010632},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}