P185
Absent words and the (dis)similarity analysis of DNA sequences: an experimental study.Negative information for building phylogenies.Indexing a sequence for mapping reads with a single mismatch.Bases of motifs for generating repeated patterns with wild cards.Direct construction of compact directed acyclic word graphsComputing Longest Previous Factor in linear time and applicationsA Simple Algorithm for Computing the Lempel Ziv FactorizationA Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring MatricesUsefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arraysSchema VersioningTerm WeightingMinimal Absent Words in a Sliding Window and Applications to On-Line Pattern MatchingOptimal Bounds for Computing $$\alpha $$ α -gapped RepeatsSubspace Clustering TechniquesLinear algorithm for conservative degenerate pattern matchingCartesian and Lyndon treesEfficient enumeration of non-equivalent squares in partial words with few holesCounting maximal-exponent factors in words40 years of suffix treesComputing maximal-exponent factors in an overlap-free wordEfficient computation of maximal anti-exponent in palindrome-free stringsLinear-size suffix triesNear-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE QueriesOn the density of Lyndon roots in factorsOrder-preserving indexingComputing the Burrows–Wheeler transform in place and in small spaceInfinite binary words containing repetitions of odd periodStringMasters 2012 & 2013 special issue – volume 2Abelian borders in binary wordsCovering Problems for Partial Words and for Indeterminate StringsFinite repetition threshold for large alphabetsNote on the greedy parsing optimality for dictionary-based text compressionOn the average number of regularities in a wordComputing the Longest Previous FactorA comparison of index-based lempel-Ziv LZ77 factorization algorithmsComputing all subtree repeats in ordered treesFewest repetitions in infinite binary wordsImproved algorithms for the range next value problem and applicationsUsing minimal absent words to build phylogenyComputing Longest Previous non-overlapping Factors
P50
Q35966753-9EE3BDBA-1B0F-44C4-A210-911AA23B0DCDQ38043051-0980A824-247C-4451-AC83-716D0CF23699Q38913414-8E533E11-29F1-4B50-8EF6-463F91E8ADD1Q42600814-1D312EBE-FCDE-4AB2-B1FC-03188AE7C10AQ55892827-15F1DEB6-78AA-4276-B3D6-E83C83ADE5E5Q56767309-D8648026-2831-462E-97A2-3DB5D5C04B52Q56783714-751B0105-7EE5-4446-9D83-D81957D8A927Q56813219-61F051A0-178C-4B3D-9D89-CB8ED1A26ACCQ56814566-CD302084-9242-4234-A19C-272AEE26102FQ57381995-67C00B1C-5D6D-4033-978E-7DC06663F94DQ57744758-DC7F08F4-3705-404E-9DFB-E392491C1EE5Q58064450-EE52EC00-0D10-4355-9C0B-E68D13B86AB5Q58064455-4E2ECA6A-E329-41FF-B9AF-0E75048D6F95Q58799638-85FB92A8-EEC0-437B-9183-D71B160F3369Q60315577-B32D7897-A516-4153-B33D-4931146F1DABQ61677815-735A5B9C-FD79-464A-94B3-2AD9BD7D8C12Q61677816-0A20ACB7-AF56-421B-A3B2-504521E5614AQ61677821-8ED02C4B-D7B0-4313-B653-AA0EA6110A25Q61677822-27E1084C-BC4A-4D25-B55E-64AE4772FB95Q61677825-80BC2D2C-CE5B-4AE0-9EEF-34B11CA68E8FQ61677827-7FF08744-B484-445C-A05A-25BD3434103EQ61677829-27C5AB3A-02E7-4D04-B716-A45C0F32C870Q61677831-55E9DAEA-3352-4992-8389-1D7973B0DF05Q61677832-A6AAFB51-CBE2-491A-B973-968CFE15F676Q61677834-C62BB026-2A4C-4C98-BDF4-A9EEC5FE6956Q61677839-C5A7967D-F34D-4E02-B18F-A648A0BBE610Q61677840-A18DD53E-D858-46C0-9973-5B96AFCAE3A4Q61677841-4E372C97-9459-4B2B-86F0-19FE0D2A8754Q61677844-00C353C9-9541-4871-BD27-7F113FD16794Q61677845-976F4554-2501-43AC-8F65-873016C096D6Q61677847-E3ACF2CD-52B4-4701-84B6-70A531CD3146Q61677850-ED58396D-421D-49EA-B7B3-D238ABC15752Q61677852-83E7EB32-35F1-4E80-9AFF-FA336109C29FQ61677857-A3C6E681-CFD7-4E22-8070-A434A9586C0AQ61677864-7DDE2318-9BA9-43F1-BDA2-90A6643A63D4Q61677867-3C1D0B16-4E11-48BC-BED2-12491DCE6D5DQ61677869-CC4E51A7-5AE9-4CBA-9C29-DBEDA446843BQ61677872-B79697BB-2BE3-49B3-A906-CDE935FA32AAQ61677880-DBF59B7B-38AF-4D6F-86F2-42555D182CFAQ61677890-8664EDE8-ED26-4428-BC82-65848D7F851C
P50
description
French computer scientist
@en
informaticien français
@fr
informáticu teóricu francés
@ast
ríomheolaí Francach
@ga
name
Maxime Crochemore
@ast
Maxime Crochemore
@ca
Maxime Crochemore
@en
Maxime Crochemore
@es
Maxime Crochemore
@fr
Maxime Crochemore
@nl
Maxime Crochemore
@pt
Maxime Crochemore
@sl
type
label
Maxime Crochemore
@ast
Maxime Crochemore
@ca
Maxime Crochemore
@en
Maxime Crochemore
@es
Maxime Crochemore
@fr
Maxime Crochemore
@nl
Maxime Crochemore
@pt
Maxime Crochemore
@sl
prefLabel
Maxime Crochemore
@ast
Maxime Crochemore
@ca
Maxime Crochemore
@en
Maxime Crochemore
@es
Maxime Crochemore
@fr
Maxime Crochemore
@nl
Maxime Crochemore
@pt
Maxime Crochemore
@sl
P1006
P214
P227
P244
P268
P269
P648
P1006
P1280
P1556
crochemore.maxime
P184
P19
P1960
rQkFVs4AAAAJ