scientific article; zbMATH DE number 5494664

MaRDI QIDQ5301985zbMATH OpenFDO

Authors Liviu P. Dinu, Andrea Sgarro

Publication date 20 January 2009

zbMATH Keywords

combinatorics of sequencesDNA sequenceslow-complexity distancesmathematical linguisticsrank distancesequence distancesstring distances

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorics on words (68R15) Linguistics (91F20) Protein sequences, DNA sequences (92D20)

Recommendations

• Rank distance bicodes and their generalization
• Sequence of maximal distance codes in graphs or other metric spaces
• Duplication Distance to the Root for Binary Sequences
• Minimum and maximum distances between failures in binary sequences
• Non-linear maximum rank distance codes
• Theory of codes with maximum rank distance
• Puncturing maximum rank distance codes
• Minimum many-to-many matchings for computing the distance between two sequences
• A new family of linear maximum rank distance codes
• Correlation measure, linear complexity and maximum order complexity for families of binary sequences

Cited in

(1)

• Binary periodic synchronizing sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301985)