Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs

Picking alignments from (steiner) trees

Proceedings of the sixth annual international conference on Computational biology

Speeding Up the DIALIGN Multiple Alignment Program by Using the `Greedy Alignment of BIOlogical Sequences LIBrary' (GABIOS-LIB)

JOBIM '00 Selected papers from the First International Conference on Computational Biology, Biology, Informatics, and Mathematics

Extracting constrained 2-interval subsets in 2-interval sets

Theoretical Computer Science

Lagrangean relaxation with clusters for point-feature cartographic label placement problems

Computers and Operations Research

Multiple genome alignment: chaining algorithms revisited

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

On restrictions of balanced 2-interval graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

On the parameterized complexity of some optimization problems related to multiple-interval graphs

Theoretical Computer Science

On the parameterized complexity of some optimization problems related to multiple-interval graphs

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Recognizing d-interval graphs and d-track interval graphs

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics

Efficient chaining of seeds in ordered trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing

Efficient chaining of seeds in ordered trees

Journal of Discrete Algorithms

Maximum regular induced subgraphs in 2P3-free graphs

Theoretical Computer Science