Faster algorithms for finding lowest common ancestors in directed acyclic graphs