Compositional properties of alignments
From MaRDI portal
Publication:2071523
DOI10.1007/s11786-020-00496-8OpenAlexW3117892846MaRDI QIDQ2071523
Peter F. Stadler, Christian Höner zu Siederdissen, Sarah J. Berkemer
Publication date: 28 January 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-020-00496-8
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Alignment of trees -- an alternative to tree edit
- Comparison of biosequences
- Subgraph isomorphism, matching relational structures and maximal cliques
- Non-approximability of weighted multiple sequence alignment.
- Fifty years of graph matching, network alignment and network comparison
- Partially local multi-way alignments
- Algebraic dynamic programming on trees
- Phylogenetic Footprinting and Consistent Sets of Local Aligments
- Exact Algorithm for the Maximum Induced Planar Subgraph Problem
- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
- The Multiple Sequence Alignment Problem in Biology
- Biological Sequence Analysis
- Comparing Top k Lists
- Sneaking around concatMap
- Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
- The complexity of multiple sequence alignment with SP-score that is a metric
This page was built for publication: Compositional properties of alignments