Counting, Generating and Sampling Tree Alignments

DOI10.1007/978-3-319-38827-4_5zbMath1346.92048DBLPconf/alcob/ChauveCP16arXiv1505.05983OpenAlexW2249602410WikidataQ57220962 ScholiaQ57220962MaRDI QIDQ2823014

Cedric Chauve, Yann Ponty, Julien Courtiel

Publication date: 6 October 2016

Published in: Algorithms for Computational Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.05983

zbMATH Keywords

dynamic programmingRNA secondary structuretree alignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20)

Related Items (3)

Algebraic dynamic programming on trees ⋮ Counting, Generating, Analyzing and Sampling Tree Alignments ⋮ Counting, Generating and Sampling Tree Alignments

Uses Software

• CONTRAlign
• RNAforester

Cites Work

• Unnamed Item
• Unnamed Item
• Forest alignment with affine gaps and anchors, applied in RNA structure comparison
• Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• The number of standard and of effective multiple alignments
• Counting, Generating and Sampling Tree Alignments
• CONTRAlign: Discriminative Training for Protein Sequence Alignment

This page was built for publication: Counting, Generating and Sampling Tree Alignments