Suchergebnisse - "combinatorial algorithms on words"

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property

Autoren: Paola Bonizzoni Clelia De Felice Brian Riccardi et al.

Weitere Verfasser: Paola Bonizzoni Clelia De Felice Brian Riccardi et al.

Schlagwörter: FOS: Computer and information sciences, Lyndon factorization, 13. Climate action, Formal Languages and Automata Theory (cs.FL), Combinatorial algorithms on words, Lyndon words, Computer Science - Formal Languages and Automata Theory, 14. Life underwater, ddc:004, 16. Peace & justice

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2406.18473
https://hdl.handle.net/10281/514379
https://doi.org/10.4230/LIPIcs.MFCS.2024.31
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31
https://hdl.handle.net/11386/4875691
https://doi.org/10.4230/LIPIcs.MFCS.2024.31

Unveiling the Connection Between the Lyndon Factorization and the Canonical Inverse Lyndon Factorization via a Border Property

Autoren: Bonizzoni, Paola De Felice, Clelia Riccardi, Brian et al.

Weitere Verfasser: Bonizzoni, Paola De Felice, Clelia Riccardi, Brian et al.

Schlagwörter: Lyndon words, Lyndon factorization, Combinatorial algorithms on words

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.MFCS.2024.31
https://nbn-resolving.org/urn:nbn:de:0030-drops-205879
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31

On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties

Autoren: Bonizzoni, Paola De Felice, Clelia Zaccagnino, Rocco et al.

Quelle: Theoretical Computer Science. 862:24-41

Schlagwörter: Combinatorial algorithms on words, Lyndon factorization, Lyndon words, 0102 computer and information sciences, 0101 mathematics, combinatorial algorithms on words, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1911.01851
https://arxiv.org/pdf/1911.01851v1
https://www.sciencedirect.com/science/article/pii/S0304397520306253
https://ui.adsabs.harvard.edu/abs/2019arXiv191101851B/abstract
https://arxiv.org/abs/1911.01851
https://www.iris.unisa.it/handle/11386/4752905
https://boa.unimib.it/handle/10281/295802
https://hdl.handle.net/10281/295802
https://doi.org/10.1016/j.tcs.2020.10.034

Combinatorial Algorithms on Words

Autoren: Zvi Galil Alberto Apostolico

Zugangs-URL: http://ci.nii.ac.jp/ncid/BA01179831

Inverse Lyndon words and inverse Lyndon factorizations of words

Autoren: BONIZZONI, PAOLA Clelia De Felice Rocco Zaccagnino et al.

Quelle: Advances in Applied Mathematics. 101:281-319

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, G.2.1, 68R15, 0102 computer and information sciences, 01 natural sciences, F.4.3, Lyndon words, Lyndon factorization, Combinatorial algorithms on words, Computer Science - Data Structures and Algorithms, DNA sequences, Applied Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/1705.10277
http://arxiv.org/abs/1705.10277
https://arxiv.org/pdf/1705.10277.pdf
https://arxiv.org/abs/1705.10277
http://ui.adsabs.harvard.edu/abs/2017arXiv170510277B/abstract
https://www.sciencedirect.com/science/article/pii/S0196885818300964
https://arxiv.org/abs/1705.10277
https://boa.unimib.it/handle/10281/206213
https://www.iris.unisa.it/handle/11386/4714941
https://dblp.uni-trier.de/db/journals/corr/corr1705.html#BonizzoniFZZ17
https://arxiv.org/pdf/1705.10277
https://hdl.handle.net/10281/206213
https://doi.org/10.1016/j.aam.2018.08.005
https://hdl.handle.net/11386/4714941
https://doi.org/10.1016/j.aam.2018.08.005

Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words

Autoren: Bonizzoni Paola De Felice Clelia Zaccagnino Rocco et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030406073
Language and Automata Theory and Applications

Schlagwörter: FOS: Computer and information sciences, Lyndon factorization, Formal Languages and Automata Theory (cs.FL), Combinatorial algorithms on words, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Formal Languages and Automata Theory, Lyndon words, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Article

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F978-3-030-40608-0_27.pdf
http://arxiv.org/abs/1911.01851
https://link.springer.com/content/pdf/10.1007%2F978-3-030-40608-0_27.pdf
https://boa.unimib.it/handle/10281/277446
https://www.iris.unisa.it/handle/11386/4735311
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-01851
https://rd.springer.com/chapter/10.1007/978-3-030-40608-0_27
https://link.springer.com/chapter/10.1007%2F978-3-030-40608-0_27
https://hdl.handle.net/11386/4735311
https://doi.org/10.1007/978-3-030-40608-0_27

A Faster Query Algorithm for the Text Fingerprinting Problem

Autoren: Biing-Feng Wang Wing-Kai Hon Hung-I Yu et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783540755197

Schlagwörter: Computational Theory and Mathematics, Fingerprints, Combinatorial algorithms on words, Patricia trie, Text indexing, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0890540111000642
https://dblp.uni-trier.de/db/journals/iandc/iandc209.html#ChanYHW11
https://dl.acm.org/doi/10.1016/j.ic.2011.04.001
https://core.ac.uk/display/82131712
https://dblp.uni-trier.de/db/conf/esa/esa2007.html#ChanYHW07
https://doi.org/10.1007/978-3-540-75520-3_13
https://rd.springer.com/chapter/10.1007/978-3-540-75520-3_13
https://link.springer.com/content/pdf/10.1007/978-3-540-75520-3_13.pdf
https://link.springer.com/chapter/10.1007/978-3-540-75520-3_13

Efficient text fingerprinting via Parikh mapping

Autoren: AMIR A. APOSTOLICO, ALBERTO LANDAU G. et al.

Quelle: Journal of Discrete Algorithms. 1:409-421

Schlagwörter: Combinatorics on words, Computational Theory and Mathematics, Combinatorial algorithms on words, Design and analysis of algorithms, Combinatorial algorithms on words, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical algorithms, 01 natural sciences, Design and analysis of algorithms, Theoretical Computer Science

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S1570866703000352
https://www.sciencedirect.com/science/article/abs/pii/S1570866703000352
https://doi.org/10.1016/S1570-8667(03)00035-2
https://dblp.uni-trier.de/db/journals/jda/jda1.html#AmirALS03
https://www.openaccessrepository.it/record/90303
https://hdl.handle.net/11577/1370733
https://doi.org/10.1016/S1570-8667(03)00035-2
http://www.sciencedirect.com/science/article/pii/S1570866703000352

Approximate swapped matching: Approximate swapped matching.

Autoren: Amihood Amir Ely Porat Moshe Lewenstein

Quelle: Lecture Notes in Computer Science ISBN: 9783540414131

Schlagwörter: Pattern matching with swaps, Combinatorics on words, Analysis of algorithms and problem complexity, 4. Education, Combinatorial algorithms on words, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Non-standard pattern matching, Approximate pattern matching, 0202 electrical engineering, electronic engineering, information engineering, Pattern matching, Nonnumerical algorithms, Design and analysis of algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1856380
https://doi.org/10.1016/s0020-0190(01)00302-7
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2000.html#AmirLP00
https://link.springer.com/chapter/10.1007%2F3-540-44450-5_24

PATTERN MATCHING WITH SWAPS IN PRACTICE

Autoren: Campanelli M CANTONE, Domenico FARO, SIMONE et al.

Quelle: International Journal of Foundations of Computer Science. 23:323-342

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, approximate pattern matching with swaps, nonstandard pattern matching, combinatorial algorithms on words, design and analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.dmi.unict.it/~faro/papers/journal/faroJ7.pdf
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs23.html#CampanelliCFG12
https://www.worldscientific.com/doi/abs/10.1142/S0129054112400151
https://hdl.handle.net/20.500.11769/30593
https://doi.org/10.1142/S0129054112400151
http://www.worldscientific.com/doi/abs/10.1142/S0129054112400151

Covering a string

Autoren: Dennis Moore Kunsoo Park Costas S. Iliopoulos

Quelle: Lecture Notes in Computer Science ISBN: 354056764X

Schlagwörter: Combinatorics on words, periodicity of strings, 0202 electrical engineering, electronic engineering, information engineering, covering of strings, 0102 computer and information sciences, 02 engineering and technology, string algorithms, 01 natural sciences, combinatorial algorithms on words

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/936187
https://doi.org/10.1007/bf01955677
https://dblp.uni-trier.de/db/conf/cpm/cpm93.html#IliopoulosMP93
https://link.springer.com/chapter/10.1007/BFb0029796
https://link.springer.com/content/pdf/10.1007/bfb0029796.pdf
https://rd.springer.com/chapter/10.1007/BFb0029796

Character sets of strings

Autoren: Didier, Gilles Schmidt, Thomas Stoye, Jens et al.

Weitere Verfasser: Didier, Gilles Schmidt, Thomas Stoye, Jens et al.

Quelle: Journal of Discrete Algorithms. 5:330-340

Schlagwörter: Comparative genomics, Natural language processing, Fingerprints, Combinatorial algorithms on words, 0206 medical engineering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Theory and Mathematics, Character sets, Discrete Mathematics and Combinatorics

Zugangs-URL: https://hal.science/hal-01614122v1
https://doi.org/10.1016/j.jda.2006.03.021

Faster algorithms for string matching with k mismatches: Faster algorithms for string matching with \(k\) mismatches

Autoren: AmirAmihood PoratEly LewensteinMoshe

Quelle: Journal of Algorithms. 50:257-275

Schlagwörter: Combinatorics on words, Approximate string matching, Hamming distance, Combinatorial algorithms on words, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical algorithms, 01 natural sciences, Design and analysis of algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2105336
https://doi.org/10.1016/s0196-6774(03)00097-x
https://dl.acm.org/doi/10.5555/338219.338641
https://www.sciencedirect.com/science/article/abs/pii/S019667740300097X
https://dblp.uni-trier.de/db/journals/jal/jal50.html#AmirLP04
http://portal.acm.org/citation.cfm?id=338641
https://dl.acm.org/doi/10.1016/S0196-6774%2803%2900097-X

Overlap matching: Overlap matching.

Autoren: Amir, Amihood Cole, Richard Hariharan, Ramesh et al.

Quelle: Information and Computation. 181:57-74

Schlagwörter: Pattern matching with swaps, Combinatorics on words, Pattern recognition, speech recognition, Combinatorial algorithms on words, School of Automation), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Non-standard pattern matching, Theoretical Computer Science, Computer Science Applications, Computational Theory and Mathematics, Computer Science & Automation (Formerly, 0202 electrical engineering, electronic engineering, information engineering, Pattern matching, Searching and sorting, Design and analysis of algorithms, Information Systems

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/1967119
https://doi.org/10.1016/s0890-5401(02)00035-4
https://dl.acm.org/doi/10.5555/365411.365459
https://dl.acm.org/citation.cfm?id=763283

Optimal parallel detection of squares in strings

Autoren: Alberto Apostolico

Quelle: Algorithmica. 8:285-319

Schlagwörter: squares and repetitions in a string, Combinatorics on words, string matching, avoidable regularities, Analysis of algorithms and problem complexity, Distributed algorithms, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, combinatorial algorithms on words

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/64240
https://doi.org/10.1007/bf01758848
https://link.springer.com/content/pdf/10.1007/BF01758848.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica8.html#Apostolico92
https://link.springer.com/article/10.1007%2FBF01758848

Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words

Autoren: Bonizzoni P. De Felice C. Zaccagnino R. et al.

Weitere Verfasser: Bonizzoni P. De Felice C. Zaccagnino R. et al.

Schlagwörter: Combinatorial algorithms on words, Lyndon factorization, Lyndon words, lang, anthro-se

Relation: http://hdl.handle.net/10281/277446

Verfügbarkeit: http://hdl.handle.net/10281/277446

Pattern Matching with Swaps for Short Patterns in Linear Time

Autoren: CANTONE, Domenico FARO, SIMONE

Quelle: Lecture Notes in Computer Science ISBN: 9783540958901

Schlagwörter: Combinatorial algorithms on words, Design and analysis of algorithms, Nonstandard pattern matching, Pattern matching with swaps, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F978-3-540-95891-8_25.pdf
https://link.springer.com/chapter/10.1007/978-3-540-95891-8_25
https://dblp.uni-trier.de/db/conf/sofsem/sofsem2009.html#CantoneF09
https://rd.springer.com/chapter/10.1007/978-3-540-95891-8_25

A New Algorithm for Efficient Pattern Matching with Swaps

Autoren: CAMPANELLI M CANTONE, Domenico FARO, SIMONE

Quelle: Lecture Notes in Computer Science ISBN: 9783642102165

Schlagwörter: Combinatorial algorithms on words, Design and analysis of algorithms, Nonstandard pattern matching, Pattern matching with swaps, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/chapter/10.1007%2F978-3-642-10217-2_24
https://ui.adsabs.harvard.edu/abs/2009LNCS.5874..230C/abstract
https://dblp.uni-trier.de/db/conf/iwoca/iwoca2009.html#CampanelliCF09
https://link.springer.com/10.1007/978-3-642-10217-2_24
https://rd.springer.com/chapter/10.1007/978-3-642-10217-2_24

[Untitled]

Autoren: Amihood Amir Moshe Lewenstein Ely Porat A et al.

Weitere Verfasser: Amihood Amir Moshe Lewenstein Ely Porat A et al.

Quelle: http://140.112.28.144/ATALab/Research Activities Description/Theory/Seminar/hot paper/algorithm/Faster algorithms for string matching with k mismatches.pdf.

Schlagwörter: Design and analysis of algorithms, Combinatorial algorithms on words, Approximate string matching, Hamming distance

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.2867; http://140.112.28.144/ATALab/Research Activities Description/Theory/Seminar/hot paper/algorithm/Faster algorithms for string matching with k mismatches.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.2867
http://140.112.28.144/ATALab/Research Activities Description/Theory/Seminar/hot paper/algorithm/Faster algorithms for string matching with k mismatches.pdf

Combinatorial Algorithms on Words

Autoren: Alberto Apostolico Zvi Galil

Resource Type: eBook.

Schlagworte: Mathematical logic, Discrete mathematics

Categories: MATHEMATICS / Logic, MATHEMATICS / Discrete Mathematics