On Recovering Syntenic Blocks from Comparative Maps

DOI10.1007/978-3-540-85097-7_30zbMath1168.68609OpenAlexW1536516634MaRDI QIDQ5505670

Binhai Zhu, Bin Fu, Zhixiang Chen, Ming-Hui Jiang

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (1)

Maximal strip recovery problem with gaps: hardness and approximation algorithms

Cites Work

• Unnamed Item
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
• Improved algorithms for largest cardinality 2-interval pattern problem
• On the computational complexity of 2-interval pattern matching problems
• Extracting constrained 2-interval subsets in 2-interval sets
• Non-breaking Similarity of Genomes with Gene Repetitions
• Linear FPT reductions and computational lower bounds
• A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
• The complexity of satisfiability problems
• Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
• Automata, Languages and Programming
• Scheduling Split Intervals
• Algorithms – ESA 2005

This page was built for publication: On Recovering Syntenic Blocks from Comparative Maps