Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5045896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for identifying maximal common connected sets of interval graphs |
scientific article; zbMATH DE number 5045896 |
Statements
Fast algorithms for identifying maximal common connected sets of interval graphs (English)
0 references
14 August 2006
0 references
comparative genomics
0 references
interval graph
0 references
common connected set
0 references
umbrella-free ordering
0 references
0 references
0.936043381690979
0 references
0.7651984095573425
0 references
0.7593559622764587
0 references
0.7562291026115417
0 references
0.7509755492210388
0 references
